./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version dbf71c69 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ --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 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 --- 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-dbf71c6-m [2022-10-17 10:23:20,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-17 10:23:20,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-17 10:23:20,539 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-17 10:23:20,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-17 10:23:20,541 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-17 10:23:20,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-17 10:23:20,546 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-17 10:23:20,548 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-17 10:23:20,550 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-17 10:23:20,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-17 10:23:20,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-17 10:23:20,553 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-17 10:23:20,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-17 10:23:20,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-17 10:23:20,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-17 10:23:20,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-17 10:23:20,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-17 10:23:20,562 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-17 10:23:20,564 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-17 10:23:20,566 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-17 10:23:20,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-17 10:23:20,569 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-17 10:23:20,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-17 10:23:20,576 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-17 10:23:20,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-17 10:23:20,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-17 10:23:20,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-17 10:23:20,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-17 10:23:20,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-17 10:23:20,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-17 10:23:20,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-17 10:23:20,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-17 10:23:20,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-17 10:23:20,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-17 10:23:20,586 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-17 10:23:20,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-17 10:23:20,587 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-17 10:23:20,587 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-17 10:23:20,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-17 10:23:20,589 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-17 10:23:20,590 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-10-17 10:23:20,616 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-17 10:23:20,617 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-17 10:23:20,617 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-17 10:23:20,617 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-17 10:23:20,618 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-17 10:23:20,618 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-17 10:23:20,619 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-17 10:23:20,619 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-17 10:23:20,619 INFO L138 SettingsManager]: * Use SBE=true [2022-10-17 10:23:20,620 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-17 10:23:20,620 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-17 10:23:20,620 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-17 10:23:20,620 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-17 10:23:20,620 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-17 10:23:20,621 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-17 10:23:20,621 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-17 10:23:20,621 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-17 10:23:20,621 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-17 10:23:20,622 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-17 10:23:20,622 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-17 10:23:20,622 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-17 10:23:20,622 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-17 10:23:20,622 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-17 10:23:20,623 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-17 10:23:20,623 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:23:20,623 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-17 10:23:20,623 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-17 10:23:20,624 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-17 10:23:20,624 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-17 10:23:20,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-17 10:23:20,624 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-10-17 10:23:20,624 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-10-17 10:23:20,625 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-17 10:23:20,625 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_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/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_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ 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 -> 1b7eb90186eb2f5804d582daa800e24f20cc36e3f07dd8983b72b6a43dcf9225 [2022-10-17 10:23:20,897 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-17 10:23:20,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-17 10:23:20,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-17 10:23:20,935 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-17 10:23:20,937 INFO L275 PluginConnector]: CDTParser initialized [2022-10-17 10:23:20,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/../../sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:23:21,010 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/data/ed9db4106/ec5dd656ae104a4e99cafab7af9a1682/FLAG1275e6ef0 [2022-10-17 10:23:21,625 INFO L306 CDTParser]: Found 1 translation units. [2022-10-17 10:23:21,630 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:23:21,647 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/data/ed9db4106/ec5dd656ae104a4e99cafab7af9a1682/FLAG1275e6ef0 [2022-10-17 10:23:21,882 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/data/ed9db4106/ec5dd656ae104a4e99cafab7af9a1682 [2022-10-17 10:23:21,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-17 10:23:21,886 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-10-17 10:23:21,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-17 10:23:21,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-17 10:23:21,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-17 10:23:21,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:23:21" (1/1) ... [2022-10-17 10:23:21,893 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c0a199 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:21, skipping insertion in model container [2022-10-17 10:23:21,894 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.10 10:23:21" (1/1) ... [2022-10-17 10:23:21,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-17 10:23:21,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-17 10:23:22,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-10-17 10:23:22,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:23:22,441 INFO L203 MainTranslator]: Completed pre-run [2022-10-17 10:23:22,453 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/sv-benchmarks/c/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-10-17 10:23:22,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-17 10:23:22,543 INFO L208 MainTranslator]: Completed translation [2022-10-17 10:23:22,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22 WrapperNode [2022-10-17 10:23:22,544 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-17 10:23:22,545 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-17 10:23:22,545 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-17 10:23:22,545 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-17 10:23:22,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,572 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,622 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-10-17 10:23:22,623 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-17 10:23:22,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-17 10:23:22,624 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-17 10:23:22,624 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-17 10:23:22,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,638 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,662 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,665 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-17 10:23:22,688 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-17 10:23:22,688 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-17 10:23:22,688 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-17 10:23:22,690 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (1/1) ... [2022-10-17 10:23:22,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-17 10:23:22,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/z3 [2022-10-17 10:23:22,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-17 10:23:22,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-17 10:23:22,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-17 10:23:22,776 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-10-17 10:23:22,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-17 10:23:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-17 10:23:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-17 10:23:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-10-17 10:23:22,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-10-17 10:23:22,778 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-10-17 10:23:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-10-17 10:23:22,779 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-10-17 10:23:22,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-10-17 10:23:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-17 10:23:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-10-17 10:23:22,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-17 10:23:22,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-17 10:23:22,782 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-10-17 10:23:22,934 INFO L235 CfgBuilder]: Building ICFG [2022-10-17 10:23:22,936 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-17 10:23:23,527 INFO L276 CfgBuilder]: Performing block encoding [2022-10-17 10:23:24,000 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-17 10:23:24,001 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-17 10:23:24,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:23:24 BoogieIcfgContainer [2022-10-17 10:23:24,004 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-17 10:23:24,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-17 10:23:24,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-17 10:23:24,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-17 10:23:24,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.10 10:23:21" (1/3) ... [2022-10-17 10:23:24,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e9d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:23:24, skipping insertion in model container [2022-10-17 10:23:24,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.10 10:23:22" (2/3) ... [2022-10-17 10:23:24,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e9d4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.10 10:23:24, skipping insertion in model container [2022-10-17 10:23:24,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:23:24" (3/3) ... [2022-10-17 10:23:24,017 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-10-17 10:23:24,026 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-10-17 10:23:24,036 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-17 10:23:24,037 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-17 10:23:24,037 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-10-17 10:23:24,104 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-10-17 10:23:24,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-10-17 10:23:24,220 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-10-17 10:23:24,221 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:23:24,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-10-17 10:23:24,225 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-10-17 10:23:24,230 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-10-17 10:23:24,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-17 10:23:24,248 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;@2e79c41f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-17 10:23:24,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-10-17 10:23:24,273 INFO L130 PetriNetUnfolder]: 0/64 cut-off events. [2022-10-17 10:23:24,273 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-10-17 10:23:24,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:24,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:24,275 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:24,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:24,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1057251517, now seen corresponding path program 1 times [2022-10-17 10:23:24,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:24,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058296844] [2022-10-17 10:23:24,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:24,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:25,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:25,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:25,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058296844] [2022-10-17 10:23:25,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058296844] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:25,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:25,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-17 10:23:25,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997390672] [2022-10-17 10:23:25,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:25,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-17 10:23:25,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:25,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-17 10:23:25,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-17 10:23:25,082 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2022-10-17 10:23:25,086 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,086 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:25,086 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2022-10-17 10:23:25,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:25,280 INFO L130 PetriNetUnfolder]: 37/298 cut-off events. [2022-10-17 10:23:25,280 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-10-17 10:23:25,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 298 events. 37/298 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1157 event pairs, 19 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 336. Up to 51 conditions per place. [2022-10-17 10:23:25,286 INFO L137 encePairwiseOnDemand]: 115/120 looper letters, 11 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-10-17 10:23:25,286 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 272 flow [2022-10-17 10:23:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-17 10:23:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-10-17 10:23:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-10-17 10:23:25,320 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-10-17 10:23:25,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-10-17 10:23:25,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-10-17 10:23:25,326 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:25,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-10-17 10:23:25,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,345 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,347 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-10-17 10:23:25,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 272 flow [2022-10-17 10:23:25,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 117 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-10-17 10:23:25,364 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-10-17 10:23:25,366 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-10-17 10:23:25,372 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-10-17 10:23:25,373 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-10-17 10:23:25,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:25,374 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:25,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-17 10:23:25,375 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:25,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:25,378 INFO L85 PathProgramCache]: Analyzing trace with hash -233584859, now seen corresponding path program 1 times [2022-10-17 10:23:25,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:25,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78965746] [2022-10-17 10:23:25,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:25,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:25,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:25,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:25,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:25,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78965746] [2022-10-17 10:23:25,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78965746] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:25,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:25,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629389388] [2022-10-17 10:23:25,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:25,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:25,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:25,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:25,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:25,920 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-10-17 10:23:25,922 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:25,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:25,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-10-17 10:23:25,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:27,726 INFO L130 PetriNetUnfolder]: 1698/4149 cut-off events. [2022-10-17 10:23:27,726 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-10-17 10:23:27,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 4149 events. 1698/4149 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 34293 event pairs, 232 based on Foata normal form. 0/4044 useless extension candidates. Maximal degree in co-relation 6877. Up to 950 conditions per place. [2022-10-17 10:23:27,760 INFO L137 encePairwiseOnDemand]: 108/120 looper letters, 32 selfloop transitions, 8 changer transitions 84/201 dead transitions. [2022-10-17 10:23:27,761 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 201 transitions, 652 flow [2022-10-17 10:23:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:23:27,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:23:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1299 transitions. [2022-10-17 10:23:27,769 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8326923076923077 [2022-10-17 10:23:27,769 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1299 transitions. [2022-10-17 10:23:27,769 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1299 transitions. [2022-10-17 10:23:27,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:27,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1299 transitions. [2022-10-17 10:23:27,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.92307692307692) internal successors, (1299), 13 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,782 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,784 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,784 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 13 states and 1299 transitions. [2022-10-17 10:23:27,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 201 transitions, 652 flow [2022-10-17 10:23:27,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-10-17 10:23:27,792 INFO L231 Difference]: Finished difference. Result has 144 places, 105 transitions, 302 flow [2022-10-17 10:23:27,793 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=105} [2022-10-17 10:23:27,794 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 19 predicate places. [2022-10-17 10:23:27,794 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 105 transitions, 302 flow [2022-10-17 10:23:27,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:27,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:27,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:27,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-17 10:23:27,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:27,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 134879073, now seen corresponding path program 1 times [2022-10-17 10:23:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:27,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862078468] [2022-10-17 10:23:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:28,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:28,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:28,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862078468] [2022-10-17 10:23:28,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862078468] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:28,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:28,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:28,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854239604] [2022-10-17 10:23:28,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:28,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:28,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:28,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:28,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:28,192 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-10-17 10:23:28,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 105 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:28,194 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:28,194 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-10-17 10:23:28,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:29,448 INFO L130 PetriNetUnfolder]: 1010/2158 cut-off events. [2022-10-17 10:23:29,448 INFO L131 PetriNetUnfolder]: For 4344/4344 co-relation queries the response was YES. [2022-10-17 10:23:29,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 2158 events. 1010/2158 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13955 event pairs, 312 based on Foata normal form. 54/2118 useless extension candidates. Maximal degree in co-relation 6546. Up to 677 conditions per place. [2022-10-17 10:23:29,472 INFO L137 encePairwiseOnDemand]: 109/120 looper letters, 41 selfloop transitions, 10 changer transitions 64/192 dead transitions. [2022-10-17 10:23:29,472 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 192 transitions, 978 flow [2022-10-17 10:23:29,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:23:29,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:23:29,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1290 transitions. [2022-10-17 10:23:29,479 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2022-10-17 10:23:29,479 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1290 transitions. [2022-10-17 10:23:29,479 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1290 transitions. [2022-10-17 10:23:29,480 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:29,480 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1290 transitions. [2022-10-17 10:23:29,485 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.23076923076923) internal successors, (1290), 13 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,491 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,492 INFO L175 Difference]: Start difference. First operand has 144 places, 105 transitions, 302 flow. Second operand 13 states and 1290 transitions. [2022-10-17 10:23:29,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 192 transitions, 978 flow [2022-10-17 10:23:29,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 192 transitions, 926 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-10-17 10:23:29,522 INFO L231 Difference]: Finished difference. Result has 143 places, 111 transitions, 411 flow [2022-10-17 10:23:29,523 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=411, PETRI_PLACES=143, PETRI_TRANSITIONS=111} [2022-10-17 10:23:29,525 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 18 predicate places. [2022-10-17 10:23:29,525 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 111 transitions, 411 flow [2022-10-17 10:23:29,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:29,527 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:29,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-17 10:23:29,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:29,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:29,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1777426391, now seen corresponding path program 1 times [2022-10-17 10:23:29,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:29,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723224593] [2022-10-17 10:23:29,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:29,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:29,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:29,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:29,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723224593] [2022-10-17 10:23:29,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723224593] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:29,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:29,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-10-17 10:23:29,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821676382] [2022-10-17 10:23:29,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:29,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-10-17 10:23:29,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:29,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-10-17 10:23:29,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-10-17 10:23:29,864 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-10-17 10:23:29,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 111 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:29,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:29,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-10-17 10:23:29,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:31,665 INFO L130 PetriNetUnfolder]: 2180/4466 cut-off events. [2022-10-17 10:23:31,665 INFO L131 PetriNetUnfolder]: For 9481/11024 co-relation queries the response was YES. [2022-10-17 10:23:31,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11525 conditions, 4466 events. 2180/4466 cut-off events. For 9481/11024 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 35394 event pairs, 215 based on Foata normal form. 39/4192 useless extension candidates. Maximal degree in co-relation 11444. Up to 1173 conditions per place. [2022-10-17 10:23:31,719 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 65 selfloop transitions, 17 changer transitions 13/185 dead transitions. [2022-10-17 10:23:31,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 185 transitions, 963 flow [2022-10-17 10:23:31,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-17 10:23:31,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-10-17 10:23:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-10-17 10:23:31,724 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2022-10-17 10:23:31,724 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2022-10-17 10:23:31,724 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2022-10-17 10:23:31,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:31,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2022-10-17 10:23:31,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,732 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,733 INFO L175 Difference]: Start difference. First operand has 143 places, 111 transitions, 411 flow. Second operand 10 states and 1051 transitions. [2022-10-17 10:23:31,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 185 transitions, 963 flow [2022-10-17 10:23:31,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 930 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-10-17 10:23:31,752 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 498 flow [2022-10-17 10:23:31,752 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=498, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2022-10-17 10:23:31,753 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places. [2022-10-17 10:23:31,753 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 498 flow [2022-10-17 10:23:31,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:31,754 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:31,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:31,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-10-17 10:23:31,755 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:31,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:31,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1074708796, now seen corresponding path program 1 times [2022-10-17 10:23:31,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:31,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878165123] [2022-10-17 10:23:31,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:31,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:32,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:32,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:32,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878165123] [2022-10-17 10:23:32,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878165123] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:32,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:32,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:32,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58429991] [2022-10-17 10:23:32,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:32,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:32,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:32,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:32,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:32,090 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-10-17 10:23:32,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 498 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:32,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:32,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-10-17 10:23:32,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:33,422 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][128], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 115#L853-1true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,423 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-10-17 10:23:33,423 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:33,423 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:33,423 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-10-17 10:23:33,429 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][165], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 250#(and (<= |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: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 218#(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: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 115#L853-1true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,430 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,430 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,430 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,430 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,561 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][128], [60#L3true, P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,562 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,562 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,562 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,563 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-10-17 10:23:33,616 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][165], [60#L3true, P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 250#(and (<= |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: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(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)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,617 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,617 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,617 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,618 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,651 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(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: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,652 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,652 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,652 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,652 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,679 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(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: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,679 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,680 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,680 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,680 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,680 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-10-17 10:23:33,716 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(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)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(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)), 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,716 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,716 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,717 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,717 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,741 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(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: 207#true, Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,742 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,742 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,742 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,743 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,766 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(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: 207#true, Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-10-17 10:23:33,767 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,767 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,767 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,767 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,768 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,769 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(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)), 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-10-17 10:23:33,769 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,770 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,770 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,770 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,770 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-10-17 10:23:33,796 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 218#(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: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(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)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(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)), 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-10-17 10:23:33,796 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,797 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,797 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,797 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,825 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (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|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(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 (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 218#(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: 216#(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: 157#(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_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(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: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(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)), 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-10-17 10:23:33,825 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,826 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,826 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,826 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,826 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-10-17 10:23:33,901 INFO L130 PetriNetUnfolder]: 1973/4149 cut-off events. [2022-10-17 10:23:33,901 INFO L131 PetriNetUnfolder]: For 11351/12809 co-relation queries the response was YES. [2022-10-17 10:23:33,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13561 conditions, 4149 events. 1973/4149 cut-off events. For 11351/12809 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 33691 event pairs, 173 based on Foata normal form. 95/4003 useless extension candidates. Maximal degree in co-relation 13524. Up to 701 conditions per place. [2022-10-17 10:23:33,956 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 67 selfloop transitions, 32 changer transitions 30/219 dead transitions. [2022-10-17 10:23:33,956 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 1342 flow [2022-10-17 10:23:33,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-10-17 10:23:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-10-17 10:23:33,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1369 transitions. [2022-10-17 10:23:33,962 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8775641025641026 [2022-10-17 10:23:33,962 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1369 transitions. [2022-10-17 10:23:33,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1369 transitions. [2022-10-17 10:23:33,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:33,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1369 transitions. [2022-10-17 10:23:33,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.3076923076923) internal successors, (1369), 13 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,973 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,974 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:33,974 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 498 flow. Second operand 13 states and 1369 transitions. [2022-10-17 10:23:33,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 1342 flow [2022-10-17 10:23:34,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 219 transitions, 1328 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-10-17 10:23:34,018 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 727 flow [2022-10-17 10:23:34,018 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=727, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2022-10-17 10:23:34,021 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 26 predicate places. [2022-10-17 10:23:34,021 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 727 flow [2022-10-17 10:23:34,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:34,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:34,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:34,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-17 10:23:34,022 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:34,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:34,024 INFO L85 PathProgramCache]: Analyzing trace with hash -300786303, now seen corresponding path program 1 times [2022-10-17 10:23:34,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:34,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417518849] [2022-10-17 10:23:34,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:34,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:34,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:34,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:34,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417518849] [2022-10-17 10:23:34,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417518849] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:34,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:34,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:34,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520562673] [2022-10-17 10:23:34,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:34,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:34,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:34,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:34,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:34,461 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-10-17 10:23:34,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 727 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:34,464 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:34,464 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-10-17 10:23:34,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:35,308 INFO L130 PetriNetUnfolder]: 696/2758 cut-off events. [2022-10-17 10:23:35,308 INFO L131 PetriNetUnfolder]: For 6727/7190 co-relation queries the response was YES. [2022-10-17 10:23:35,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8509 conditions, 2758 events. 696/2758 cut-off events. For 6727/7190 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 28003 event pairs, 63 based on Foata normal form. 11/2628 useless extension candidates. Maximal degree in co-relation 8421. Up to 533 conditions per place. [2022-10-17 10:23:35,363 INFO L137 encePairwiseOnDemand]: 104/120 looper letters, 46 selfloop transitions, 26 changer transitions 22/204 dead transitions. [2022-10-17 10:23:35,363 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 204 transitions, 1199 flow [2022-10-17 10:23:35,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:23:35,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:23:35,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1063 transitions. [2022-10-17 10:23:35,368 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8053030303030303 [2022-10-17 10:23:35,368 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1063 transitions. [2022-10-17 10:23:35,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1063 transitions. [2022-10-17 10:23:35,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:35,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1063 transitions. [2022-10-17 10:23:35,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.63636363636364) internal successors, (1063), 11 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,377 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,377 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 727 flow. Second operand 11 states and 1063 transitions. [2022-10-17 10:23:35,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 204 transitions, 1199 flow [2022-10-17 10:23:35,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 204 transitions, 1085 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-10-17 10:23:35,533 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 864 flow [2022-10-17 10:23:35,533 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=864, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2022-10-17 10:23:35,536 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 40 predicate places. [2022-10-17 10:23:35,536 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 864 flow [2022-10-17 10:23:35,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,537 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:35,537 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:35,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-17 10:23:35,538 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:35,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:35,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1894343971, now seen corresponding path program 2 times [2022-10-17 10:23:35,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:35,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907887918] [2022-10-17 10:23:35,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:35,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:35,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:35,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907887918] [2022-10-17 10:23:35,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907887918] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:35,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:35,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:23:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546680949] [2022-10-17 10:23:35,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:35,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:23:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:23:35,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:23:35,941 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-10-17 10:23:35,942 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 864 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:35,942 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:35,942 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-10-17 10:23:35,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:36,908 INFO L130 PetriNetUnfolder]: 896/3442 cut-off events. [2022-10-17 10:23:36,909 INFO L131 PetriNetUnfolder]: For 5906/5974 co-relation queries the response was YES. [2022-10-17 10:23:36,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9555 conditions, 3442 events. 896/3442 cut-off events. For 5906/5974 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37159 event pairs, 46 based on Foata normal form. 11/3264 useless extension candidates. Maximal degree in co-relation 9451. Up to 299 conditions per place. [2022-10-17 10:23:36,951 INFO L137 encePairwiseOnDemand]: 104/120 looper letters, 57 selfloop transitions, 27 changer transitions 20/214 dead transitions. [2022-10-17 10:23:36,951 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 214 transitions, 1419 flow [2022-10-17 10:23:36,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:23:36,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:23:36,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-10-17 10:23:36,955 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.825925925925926 [2022-10-17 10:23:36,955 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-10-17 10:23:36,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-10-17 10:23:36,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:36,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-10-17 10:23:36,959 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:36,962 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:36,963 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:36,963 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 864 flow. Second operand 9 states and 892 transitions. [2022-10-17 10:23:36,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 214 transitions, 1419 flow [2022-10-17 10:23:37,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 1339 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-10-17 10:23:37,060 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 1000 flow [2022-10-17 10:23:37,061 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1000, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2022-10-17 10:23:37,061 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 42 predicate places. [2022-10-17 10:23:37,061 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 1000 flow [2022-10-17 10:23:37,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:37,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:37,062 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:37,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-17 10:23:37,063 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:37,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash 367814021, now seen corresponding path program 3 times [2022-10-17 10:23:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:37,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457598312] [2022-10-17 10:23:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:37,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:37,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:37,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:37,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457598312] [2022-10-17 10:23:37,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457598312] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:37,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:37,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:23:37,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599914339] [2022-10-17 10:23:37,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:37,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:23:37,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:37,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:23:37,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:23:37,404 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-10-17 10:23:37,405 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 1000 flow. Second operand has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:37,405 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:37,405 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-10-17 10:23:37,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:39,957 INFO L130 PetriNetUnfolder]: 3592/7639 cut-off events. [2022-10-17 10:23:39,957 INFO L131 PetriNetUnfolder]: For 32422/37783 co-relation queries the response was YES. [2022-10-17 10:23:40,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26197 conditions, 7639 events. 3592/7639 cut-off events. For 32422/37783 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 71903 event pairs, 246 based on Foata normal form. 361/7648 useless extension candidates. Maximal degree in co-relation 26163. Up to 1033 conditions per place. [2022-10-17 10:23:40,043 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 44 selfloop transitions, 28 changer transitions 76/254 dead transitions. [2022-10-17 10:23:40,043 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 254 transitions, 2120 flow [2022-10-17 10:23:40,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-10-17 10:23:40,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-10-17 10:23:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1651 transitions. [2022-10-17 10:23:40,050 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8598958333333333 [2022-10-17 10:23:40,050 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1651 transitions. [2022-10-17 10:23:40,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1651 transitions. [2022-10-17 10:23:40,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:40,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1651 transitions. [2022-10-17 10:23:40,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 103.1875) internal successors, (1651), 16 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,065 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,066 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 1000 flow. Second operand 16 states and 1651 transitions. [2022-10-17 10:23:40,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 254 transitions, 2120 flow [2022-10-17 10:23:40,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 254 transitions, 1961 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-10-17 10:23:40,312 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 900 flow [2022-10-17 10:23:40,313 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=900, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2022-10-17 10:23:40,314 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 53 predicate places. [2022-10-17 10:23:40,314 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 900 flow [2022-10-17 10:23:40,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,315 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:40,315 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:40,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-10-17 10:23:40,316 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:40,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash -501813876, now seen corresponding path program 1 times [2022-10-17 10:23:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:40,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339611193] [2022-10-17 10:23:40,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:40,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:40,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339611193] [2022-10-17 10:23:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339611193] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:40,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:40,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-10-17 10:23:40,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420192634] [2022-10-17 10:23:40,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:40,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-10-17 10:23:40,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:40,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-10-17 10:23:40,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-10-17 10:23:40,715 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-10-17 10:23:40,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 900 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:40,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:40,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-10-17 10:23:40,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:41,539 INFO L130 PetriNetUnfolder]: 684/3583 cut-off events. [2022-10-17 10:23:41,540 INFO L131 PetriNetUnfolder]: For 8383/8607 co-relation queries the response was YES. [2022-10-17 10:23:41,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10248 conditions, 3583 events. 684/3583 cut-off events. For 8383/8607 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 44093 event pairs, 72 based on Foata normal form. 17/3387 useless extension candidates. Maximal degree in co-relation 10141. Up to 397 conditions per place. [2022-10-17 10:23:41,584 INFO L137 encePairwiseOnDemand]: 108/120 looper letters, 23 selfloop transitions, 9 changer transitions 37/172 dead transitions. [2022-10-17 10:23:41,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 1184 flow [2022-10-17 10:23:41,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-17 10:23:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-10-17 10:23:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2022-10-17 10:23:41,587 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8107142857142857 [2022-10-17 10:23:41,588 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2022-10-17 10:23:41,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2022-10-17 10:23:41,589 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:41,589 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2022-10-17 10:23:41,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:41,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:41,595 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:41,596 INFO L175 Difference]: Start difference. First operand has 178 places, 151 transitions, 900 flow. Second operand 7 states and 681 transitions. [2022-10-17 10:23:41,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 1184 flow [2022-10-17 10:23:41,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 172 transitions, 1065 flow, removed 27 selfloop flow, removed 19 redundant places. [2022-10-17 10:23:41,763 INFO L231 Difference]: Finished difference. Result has 166 places, 132 transitions, 577 flow [2022-10-17 10:23:41,763 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=166, PETRI_TRANSITIONS=132} [2022-10-17 10:23:41,764 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 41 predicate places. [2022-10-17 10:23:41,764 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 132 transitions, 577 flow [2022-10-17 10:23:41,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:41,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:41,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:41,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-17 10:23:41,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:41,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:41,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1002254974, now seen corresponding path program 2 times [2022-10-17 10:23:41,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:41,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578558546] [2022-10-17 10:23:41,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:41,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:42,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:42,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:42,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578558546] [2022-10-17 10:23:42,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578558546] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:42,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:42,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-17 10:23:42,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226161244] [2022-10-17 10:23:42,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:42,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-17 10:23:42,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:42,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-17 10:23:42,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-10-17 10:23:42,507 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-10-17 10:23:42,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 132 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:42,509 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-10-17 10:23:42,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:42,871 INFO L130 PetriNetUnfolder]: 249/1462 cut-off events. [2022-10-17 10:23:42,872 INFO L131 PetriNetUnfolder]: For 1103/1160 co-relation queries the response was YES. [2022-10-17 10:23:42,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 1462 events. 249/1462 cut-off events. For 1103/1160 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14831 event pairs, 5 based on Foata normal form. 3/1385 useless extension candidates. Maximal degree in co-relation 3095. Up to 171 conditions per place. [2022-10-17 10:23:42,884 INFO L137 encePairwiseOnDemand]: 112/120 looper letters, 20 selfloop transitions, 5 changer transitions 12/146 dead transitions. [2022-10-17 10:23:42,884 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 146 transitions, 701 flow [2022-10-17 10:23:42,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-10-17 10:23:42,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-10-17 10:23:42,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 898 transitions. [2022-10-17 10:23:42,888 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8314814814814815 [2022-10-17 10:23:42,888 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 898 transitions. [2022-10-17 10:23:42,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 898 transitions. [2022-10-17 10:23:42,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:42,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 898 transitions. [2022-10-17 10:23:42,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.77777777777777) internal successors, (898), 9 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,896 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,896 INFO L175 Difference]: Start difference. First operand has 166 places, 132 transitions, 577 flow. Second operand 9 states and 898 transitions. [2022-10-17 10:23:42,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 146 transitions, 701 flow [2022-10-17 10:23:42,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 146 transitions, 617 flow, removed 17 selfloop flow, removed 13 redundant places. [2022-10-17 10:23:42,916 INFO L231 Difference]: Finished difference. Result has 163 places, 132 transitions, 510 flow [2022-10-17 10:23:42,916 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=163, PETRI_TRANSITIONS=132} [2022-10-17 10:23:42,917 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 38 predicate places. [2022-10-17 10:23:42,917 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 132 transitions, 510 flow [2022-10-17 10:23:42,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:42,918 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:42,918 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:42,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-17 10:23:42,918 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:42,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:42,919 INFO L85 PathProgramCache]: Analyzing trace with hash 683155054, now seen corresponding path program 3 times [2022-10-17 10:23:42,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:42,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665927869] [2022-10-17 10:23:42,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:42,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-17 10:23:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-17 10:23:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-17 10:23:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665927869] [2022-10-17 10:23:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665927869] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-17 10:23:44,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-17 10:23:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-10-17 10:23:44,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700755872] [2022-10-17 10:23:44,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-17 10:23:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-17 10:23:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-17 10:23:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-17 10:23:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-10-17 10:23:44,079 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 120 [2022-10-17 10:23:44,080 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 132 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:44,080 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-10-17 10:23:44,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 120 [2022-10-17 10:23:44,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-10-17 10:23:44,408 INFO L130 PetriNetUnfolder]: 91/659 cut-off events. [2022-10-17 10:23:44,408 INFO L131 PetriNetUnfolder]: For 507/526 co-relation queries the response was YES. [2022-10-17 10:23:44,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 659 events. 91/659 cut-off events. For 507/526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4870 event pairs, 3 based on Foata normal form. 4/636 useless extension candidates. Maximal degree in co-relation 1407. Up to 75 conditions per place. [2022-10-17 10:23:44,414 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 22 selfloop transitions, 5 changer transitions 11/141 dead transitions. [2022-10-17 10:23:44,414 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 141 transitions, 626 flow [2022-10-17 10:23:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-10-17 10:23:44,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-10-17 10:23:44,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1045 transitions. [2022-10-17 10:23:44,422 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2022-10-17 10:23:44,422 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1045 transitions. [2022-10-17 10:23:44,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1045 transitions. [2022-10-17 10:23:44,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-10-17 10:23:44,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1045 transitions. [2022-10-17 10:23:44,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.0) internal successors, (1045), 11 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:44,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:44,433 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:44,433 INFO L175 Difference]: Start difference. First operand has 163 places, 132 transitions, 510 flow. Second operand 11 states and 1045 transitions. [2022-10-17 10:23:44,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 141 transitions, 626 flow [2022-10-17 10:23:44,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 141 transitions, 581 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-10-17 10:23:44,441 INFO L231 Difference]: Finished difference. Result has 163 places, 128 transitions, 478 flow [2022-10-17 10:23:44,441 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=478, PETRI_PLACES=163, PETRI_TRANSITIONS=128} [2022-10-17 10:23:44,442 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 38 predicate places. [2022-10-17 10:23:44,442 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 128 transitions, 478 flow [2022-10-17 10:23:44,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-17 10:23:44,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-10-17 10:23:44,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-17 10:23:44,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-17 10:23:44,443 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-10-17 10:23:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-17 10:23:44,444 INFO L85 PathProgramCache]: Analyzing trace with hash 812719114, now seen corresponding path program 4 times [2022-10-17 10:23:44,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-17 10:23:44,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510102817] [2022-10-17 10:23:44,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-17 10:23:44,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-17 10:23:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:23:44,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-17 10:23:44,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-17 10:23:44,587 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-17 10:23:44,587 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-17 10:23:44,588 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-10-17 10:23:44,590 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-10-17 10:23:44,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-10-17 10:23:44,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-10-17 10:23:44,591 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-10-17 10:23:44,592 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-10-17 10:23:44,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-10-17 10:23:44,592 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-10-17 10:23:44,599 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-10-17 10:23:44,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-17 10:23:44,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.10 10:23:44 BasicIcfg [2022-10-17 10:23:44,773 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-17 10:23:44,774 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-10-17 10:23:44,774 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-10-17 10:23:44,774 INFO L275 PluginConnector]: Witness Printer initialized [2022-10-17 10:23:44,775 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.10 10:23:24" (3/4) ... [2022-10-17 10:23:44,776 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-10-17 10:23:44,902 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/witness.graphml [2022-10-17 10:23:44,902 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-10-17 10:23:44,903 INFO L158 Benchmark]: Toolchain (without parser) took 23017.17ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 78.8MB in the beginning and 475.5MB in the end (delta: -396.6MB). Peak memory consumption was 879.9MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,904 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-10-17 10:23:44,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 656.16ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 79.2MB in the end (delta: -530.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.96ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,905 INFO L158 Benchmark]: Boogie Preprocessor took 49.86ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,905 INFO L158 Benchmark]: RCFGBuilder took 1315.67ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 74.5MB in the end (delta: -53.3kB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,906 INFO L158 Benchmark]: TraceAbstraction took 20764.62ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 74.5MB in the beginning and 513.2MB in the end (delta: -438.7MB). Peak memory consumption was 838.1MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,906 INFO L158 Benchmark]: Witness Printer took 128.81ms. Allocated memory is still 1.4GB. Free memory was 513.2MB in the beginning and 475.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-10-17 10:23:44,908 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 656.16ms. Allocated memory is still 117.4MB. Free memory was 78.6MB in the beginning and 79.2MB in the end (delta: -530.7kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.96ms. Allocated memory is still 117.4MB. Free memory was 79.2MB in the beginning and 76.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.86ms. Allocated memory is still 117.4MB. Free memory was 76.5MB in the beginning and 74.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1315.67ms. Allocated memory is still 117.4MB. Free memory was 74.4MB in the beginning and 74.5MB in the end (delta: -53.3kB). Peak memory consumption was 41.7MB. Max. memory is 16.1GB. * TraceAbstraction took 20764.62ms. Allocated memory was 117.4MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 74.5MB in the beginning and 513.2MB in the end (delta: -438.7MB). Peak memory consumption was 838.1MB. Max. memory is 16.1GB. * Witness Printer took 128.81ms. Allocated memory is still 1.4GB. Free memory was 513.2MB in the beginning and 475.5MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L734] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L735] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L736] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=7, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=8, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t638; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=9, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L19] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 742 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1212 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1404 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 153 mSDtfsCounter, 1404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=7, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 4433 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-10-17 10:23:44,959 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_720fbd06-e596-4906-ae9b-5cafc88ec6ef/bin/uautomizer-J5u9QxTXDZ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE