./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8393723b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro --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 c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 --- 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-8393723 [2022-11-18 18:33:33,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-18 18:33:33,777 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-18 18:33:33,807 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-18 18:33:33,808 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-18 18:33:33,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-18 18:33:33,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-18 18:33:33,812 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-18 18:33:33,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-18 18:33:33,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-18 18:33:33,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-18 18:33:33,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-18 18:33:33,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-18 18:33:33,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-18 18:33:33,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-18 18:33:33,821 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-18 18:33:33,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-18 18:33:33,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-18 18:33:33,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-18 18:33:33,826 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-18 18:33:33,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-18 18:33:33,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-18 18:33:33,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-18 18:33:33,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-18 18:33:33,835 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-18 18:33:33,835 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-18 18:33:33,836 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-18 18:33:33,837 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-18 18:33:33,837 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-18 18:33:33,838 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-18 18:33:33,838 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-18 18:33:33,839 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-18 18:33:33,840 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-18 18:33:33,841 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-18 18:33:33,842 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-18 18:33:33,842 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-18 18:33:33,854 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-18 18:33:33,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-18 18:33:33,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-18 18:33:33,855 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-18 18:33:33,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-18 18:33:33,858 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-18 18:33:33,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-18 18:33:33,894 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-18 18:33:33,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-18 18:33:33,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-18 18:33:33,895 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-18 18:33:33,895 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-18 18:33:33,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-18 18:33:33,896 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-18 18:33:33,896 INFO L138 SettingsManager]: * Use SBE=true [2022-11-18 18:33:33,896 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-18 18:33:33,896 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-18 18:33:33,897 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-18 18:33:33,898 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-18 18:33:33,898 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-18 18:33:33,898 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-18 18:33:33,898 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-18 18:33:33,898 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-18 18:33:33,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-18 18:33:33,905 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-18 18:33:33,905 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:33,905 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-18 18:33:33,906 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-18 18:33:33,907 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-18 18:33:33,907 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-18 18:33:33,907 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-18 18:33:33,908 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-18 18:33:33,908 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-18 18:33:33,908 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-18 18:33:33,908 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_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/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_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro 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 -> c394bf0b454616c76d3ba114fe7f9b161b2a3a1a85dec23beec05d3a021c1c91 [2022-11-18 18:33:34,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-18 18:33:34,205 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-18 18:33:34,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-18 18:33:34,209 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-18 18:33:34,212 INFO L275 PluginConnector]: CDTParser initialized [2022-11-18 18:33:34,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/../../sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-11-18 18:33:34,299 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/data/15fbc17a5/93288e010d23491b86073811283bcb08/FLAG8d223f7df [2022-11-18 18:33:34,809 INFO L306 CDTParser]: Found 1 translation units. [2022-11-18 18:33:34,810 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i [2022-11-18 18:33:34,823 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/data/15fbc17a5/93288e010d23491b86073811283bcb08/FLAG8d223f7df [2022-11-18 18:33:35,121 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/data/15fbc17a5/93288e010d23491b86073811283bcb08 [2022-11-18 18:33:35,124 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-18 18:33:35,125 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-18 18:33:35,131 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:35,132 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-18 18:33:35,135 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-18 18:33:35,136 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,137 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d95c02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35, skipping insertion in model container [2022-11-18 18:33:35,137 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,145 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-18 18:33:35,183 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-18 18:33:35,377 WARN L234 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_8605abef-7cbc-4626-b707-e6237f4a2a09/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-11-18 18:33:35,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:35,637 INFO L203 MainTranslator]: Completed pre-run [2022-11-18 18:33:35,649 WARN L234 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_8605abef-7cbc-4626-b707-e6237f4a2a09/sv-benchmarks/c/pthread-wmm/mix017_power.opt_rmo.opt.i[958,971] [2022-11-18 18:33:35,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-18 18:33:35,767 INFO L208 MainTranslator]: Completed translation [2022-11-18 18:33:35,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35 WrapperNode [2022-11-18 18:33:35,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-18 18:33:35,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:35,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-18 18:33:35,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-18 18:33:35,776 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,814 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 146 [2022-11-18 18:33:35,814 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-18 18:33:35,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-18 18:33:35,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-18 18:33:35,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-18 18:33:35,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,841 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,843 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,846 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-18 18:33:35,847 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-18 18:33:35,848 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-18 18:33:35,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-18 18:33:35,849 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (1/1) ... [2022-11-18 18:33:35,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-18 18:33:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/z3 [2022-11-18 18:33:35,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-18 18:33:35,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-18 18:33:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-18 18:33:35,932 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-18 18:33:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-18 18:33:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-18 18:33:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-18 18:33:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-18 18:33:35,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-18 18:33:35,933 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-18 18:33:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-18 18:33:35,934 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-18 18:33:35,934 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-18 18:33:35,935 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-18 18:33:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-18 18:33:35,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-18 18:33:35,935 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-18 18:33:35,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-18 18:33:35,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-18 18:33:35,938 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-18 18:33:36,126 INFO L235 CfgBuilder]: Building ICFG [2022-11-18 18:33:36,128 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-18 18:33:36,502 INFO L276 CfgBuilder]: Performing block encoding [2022-11-18 18:33:36,768 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-18 18:33:36,769 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-18 18:33:36,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:36 BoogieIcfgContainer [2022-11-18 18:33:36,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-18 18:33:36,785 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-18 18:33:36,785 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-18 18:33:36,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-18 18:33:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 06:33:35" (1/3) ... [2022-11-18 18:33:36,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4b9344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:36, skipping insertion in model container [2022-11-18 18:33:36,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 06:33:35" (2/3) ... [2022-11-18 18:33:36,791 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4b9344 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 06:33:36, skipping insertion in model container [2022-11-18 18:33:36,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:36" (3/3) ... [2022-11-18 18:33:36,792 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_power.opt_rmo.opt.i [2022-11-18 18:33:36,810 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-18 18:33:36,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-18 18:33:36,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-18 18:33:36,832 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-18 18:33:36,943 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-18 18:33:36,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 18:33:37,073 INFO L130 PetriNetUnfolder]: 2/133 cut-off events. [2022-11-18 18:33:37,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:33:37,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-18 18:33:37,079 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 137 transitions, 294 flow [2022-11-18 18:33:37,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 133 transitions, 278 flow [2022-11-18 18:33:37,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-18 18:33:37,103 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;@25f453b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-18 18:33:37,107 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-18 18:33:37,142 INFO L130 PetriNetUnfolder]: 0/77 cut-off events. [2022-11-18 18:33:37,143 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-18 18:33:37,143 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:37,144 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:37,144 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:37,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -180066836, now seen corresponding path program 1 times [2022-11-18 18:33:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:37,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491926367] [2022-11-18 18:33:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:37,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:37,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:37,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:37,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491926367] [2022-11-18 18:33:37,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491926367] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:37,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:37,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-18 18:33:37,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912120095] [2022-11-18 18:33:37,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:37,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-18 18:33:37,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:37,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-18 18:33:37,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-18 18:33:37,918 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 137 [2022-11-18 18:33:37,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 133 transitions, 278 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:37,922 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:37,922 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 137 [2022-11-18 18:33:37,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:38,115 INFO L130 PetriNetUnfolder]: 37/318 cut-off events. [2022-11-18 18:33:38,115 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2022-11-18 18:33:38,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 318 events. 37/318 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1129 event pairs, 19 based on Foata normal form. 9/305 useless extension candidates. Maximal degree in co-relation 356. Up to 51 conditions per place. [2022-11-18 18:33:38,120 INFO L137 encePairwiseOnDemand]: 132/137 looper letters, 12 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2022-11-18 18:33:38,120 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 133 transitions, 309 flow [2022-11-18 18:33:38,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-18 18:33:38,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-18 18:33:38,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-11-18 18:33:38,141 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9440389294403893 [2022-11-18 18:33:38,142 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-11-18 18:33:38,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-11-18 18:33:38,147 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:38,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-11-18 18:33:38,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:38,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:38,158 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 137.0) internal successors, (548), 4 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:38,160 INFO L175 Difference]: Start difference. First operand has 144 places, 133 transitions, 278 flow. Second operand 3 states and 388 transitions. [2022-11-18 18:33:38,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 133 transitions, 309 flow [2022-11-18 18:33:38,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 133 transitions, 304 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-18 18:33:38,168 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 270 flow [2022-11-18 18:33:38,170 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-18 18:33:38,173 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, -4 predicate places. [2022-11-18 18:33:38,174 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 270 flow [2022-11-18 18:33:38,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:38,174 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:38,175 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:38,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-18 18:33:38,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:38,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:38,176 INFO L85 PathProgramCache]: Analyzing trace with hash -541518042, now seen corresponding path program 1 times [2022-11-18 18:33:38,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:38,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405214029] [2022-11-18 18:33:38,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:38,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:38,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:38,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:38,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405214029] [2022-11-18 18:33:38,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405214029] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:38,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:38,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:33:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199489488] [2022-11-18 18:33:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:38,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:38,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:38,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:38,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:38,707 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-18 18:33:38,708 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:38,708 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:38,708 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-18 18:33:38,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:40,028 INFO L130 PetriNetUnfolder]: 1940/4918 cut-off events. [2022-11-18 18:33:40,028 INFO L131 PetriNetUnfolder]: For 206/206 co-relation queries the response was YES. [2022-11-18 18:33:40,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7962 conditions, 4918 events. 1940/4918 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 42071 event pairs, 658 based on Foata normal form. 0/4805 useless extension candidates. Maximal degree in co-relation 7900. Up to 1720 conditions per place. [2022-11-18 18:33:40,069 INFO L137 encePairwiseOnDemand]: 128/137 looper letters, 28 selfloop transitions, 5 changer transitions 62/186 dead transitions. [2022-11-18 18:33:40,069 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 186 transitions, 568 flow [2022-11-18 18:33:40,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:33:40,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:33:40,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1056 transitions. [2022-11-18 18:33:40,075 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8564476885644768 [2022-11-18 18:33:40,075 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1056 transitions. [2022-11-18 18:33:40,076 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1056 transitions. [2022-11-18 18:33:40,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:40,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1056 transitions. [2022-11-18 18:33:40,080 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:40,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:40,084 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:40,084 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 270 flow. Second operand 9 states and 1056 transitions. [2022-11-18 18:33:40,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 186 transitions, 568 flow [2022-11-18 18:33:40,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 186 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-18 18:33:40,089 INFO L231 Difference]: Finished difference. Result has 153 places, 119 transitions, 307 flow [2022-11-18 18:33:40,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=307, PETRI_PLACES=153, PETRI_TRANSITIONS=119} [2022-11-18 18:33:40,090 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 9 predicate places. [2022-11-18 18:33:40,090 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 119 transitions, 307 flow [2022-11-18 18:33:40,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.66666666666667) internal successors, (664), 6 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:40,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:40,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:40,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-18 18:33:40,091 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:40,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2077139009, now seen corresponding path program 1 times [2022-11-18 18:33:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:40,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137506462] [2022-11-18 18:33:40,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:40,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:40,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:40,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:40,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137506462] [2022-11-18 18:33:40,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137506462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:40,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:40,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978225137] [2022-11-18 18:33:40,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:40,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:40,434 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 137 [2022-11-18 18:33:40,435 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 119 transitions, 307 flow. Second operand has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:40,436 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:40,436 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 137 [2022-11-18 18:33:40,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:41,288 INFO L130 PetriNetUnfolder]: 1348/2377 cut-off events. [2022-11-18 18:33:41,288 INFO L131 PetriNetUnfolder]: For 6205/6205 co-relation queries the response was YES. [2022-11-18 18:33:41,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8184 conditions, 2377 events. 1348/2377 cut-off events. For 6205/6205 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 14289 event pairs, 241 based on Foata normal form. 56/2379 useless extension candidates. Maximal degree in co-relation 8115. Up to 1138 conditions per place. [2022-11-18 18:33:41,315 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 31 selfloop transitions, 3 changer transitions 46/171 dead transitions. [2022-11-18 18:33:41,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 171 transitions, 781 flow [2022-11-18 18:33:41,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-18 18:33:41,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-18 18:33:41,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1050 transitions. [2022-11-18 18:33:41,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.851581508515815 [2022-11-18 18:33:41,322 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1050 transitions. [2022-11-18 18:33:41,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1050 transitions. [2022-11-18 18:33:41,323 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:41,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1050 transitions. [2022-11-18 18:33:41,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.66666666666667) internal successors, (1050), 9 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:41,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:41,330 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 137.0) internal successors, (1370), 10 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:41,331 INFO L175 Difference]: Start difference. First operand has 153 places, 119 transitions, 307 flow. Second operand 9 states and 1050 transitions. [2022-11-18 18:33:41,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 171 transitions, 781 flow [2022-11-18 18:33:41,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 171 transitions, 762 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-11-18 18:33:41,355 INFO L231 Difference]: Finished difference. Result has 144 places, 119 transitions, 319 flow [2022-11-18 18:33:41,355 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=319, PETRI_PLACES=144, PETRI_TRANSITIONS=119} [2022-11-18 18:33:41,358 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 0 predicate places. [2022-11-18 18:33:41,358 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 119 transitions, 319 flow [2022-11-18 18:33:41,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:41,359 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:41,360 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:41,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-18 18:33:41,361 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:41,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1016578579, now seen corresponding path program 1 times [2022-11-18 18:33:41,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:41,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094449648] [2022-11-18 18:33:41,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:41,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:41,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:41,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094449648] [2022-11-18 18:33:41,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094449648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:41,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:41,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-18 18:33:41,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29828517] [2022-11-18 18:33:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:41,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-18 18:33:41,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:41,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-18 18:33:41,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-18 18:33:41,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 18:33:41,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 119 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:41,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:41,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 18:33:41,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:43,685 INFO L130 PetriNetUnfolder]: 4374/7938 cut-off events. [2022-11-18 18:33:43,685 INFO L131 PetriNetUnfolder]: For 9589/10637 co-relation queries the response was YES. [2022-11-18 18:33:43,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19344 conditions, 7938 events. 4374/7938 cut-off events. For 9589/10637 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 62511 event pairs, 292 based on Foata normal form. 0/7483 useless extension candidates. Maximal degree in co-relation 19274. Up to 2343 conditions per place. [2022-11-18 18:33:43,839 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 62 selfloop transitions, 16 changer transitions 14/189 dead transitions. [2022-11-18 18:33:43,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 189 transitions, 709 flow [2022-11-18 18:33:43,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-18 18:33:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-11-18 18:33:43,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1211 transitions. [2022-11-18 18:33:43,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8839416058394161 [2022-11-18 18:33:43,852 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1211 transitions. [2022-11-18 18:33:43,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1211 transitions. [2022-11-18 18:33:43,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:43,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1211 transitions. [2022-11-18 18:33:43,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.1) internal successors, (1211), 10 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:43,859 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:43,860 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 137.0) internal successors, (1507), 11 states have internal predecessors, (1507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:43,860 INFO L175 Difference]: Start difference. First operand has 144 places, 119 transitions, 319 flow. Second operand 10 states and 1211 transitions. [2022-11-18 18:33:43,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 189 transitions, 709 flow [2022-11-18 18:33:43,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 189 transitions, 691 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-18 18:33:43,896 INFO L231 Difference]: Finished difference. Result has 145 places, 133 transitions, 422 flow [2022-11-18 18:33:43,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=422, PETRI_PLACES=145, PETRI_TRANSITIONS=133} [2022-11-18 18:33:43,897 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 1 predicate places. [2022-11-18 18:33:43,898 INFO L495 AbstractCegarLoop]: Abstraction has has 145 places, 133 transitions, 422 flow [2022-11-18 18:33:43,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.0) internal successors, (684), 6 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:43,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:43,898 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:43,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-18 18:33:43,899 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:43,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:43,899 INFO L85 PathProgramCache]: Analyzing trace with hash 211033219, now seen corresponding path program 1 times [2022-11-18 18:33:43,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:43,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978623006] [2022-11-18 18:33:43,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:43,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:44,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978623006] [2022-11-18 18:33:44,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978623006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:44,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:44,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836796255] [2022-11-18 18:33:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:44,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:44,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:44,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:44,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:44,229 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 18:33:44,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 133 transitions, 422 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:44,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:44,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 18:33:44,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:45,988 INFO L130 PetriNetUnfolder]: 3931/7569 cut-off events. [2022-11-18 18:33:45,989 INFO L131 PetriNetUnfolder]: For 15948/16960 co-relation queries the response was YES. [2022-11-18 18:33:46,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24073 conditions, 7569 events. 3931/7569 cut-off events. For 15948/16960 co-relation queries the response was YES. Maximal size of possible extension queue 553. Compared 63126 event pairs, 224 based on Foata normal form. 140/7419 useless extension candidates. Maximal degree in co-relation 24002. Up to 1782 conditions per place. [2022-11-18 18:33:46,059 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 87 selfloop transitions, 34 changer transitions 4/222 dead transitions. [2022-11-18 18:33:46,059 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 222 transitions, 1140 flow [2022-11-18 18:33:46,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-18 18:33:46,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-18 18:33:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1574 transitions. [2022-11-18 18:33:46,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8837731611454239 [2022-11-18 18:33:46,064 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1574 transitions. [2022-11-18 18:33:46,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1574 transitions. [2022-11-18 18:33:46,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:46,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1574 transitions. [2022-11-18 18:33:46,070 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 121.07692307692308) internal successors, (1574), 13 states have internal predecessors, (1574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:46,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:46,074 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 137.0) internal successors, (1918), 14 states have internal predecessors, (1918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:46,074 INFO L175 Difference]: Start difference. First operand has 145 places, 133 transitions, 422 flow. Second operand 13 states and 1574 transitions. [2022-11-18 18:33:46,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 222 transitions, 1140 flow [2022-11-18 18:33:46,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 222 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-18 18:33:46,169 INFO L231 Difference]: Finished difference. Result has 162 places, 153 transitions, 701 flow [2022-11-18 18:33:46,169 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=701, PETRI_PLACES=162, PETRI_TRANSITIONS=153} [2022-11-18 18:33:46,170 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 18 predicate places. [2022-11-18 18:33:46,170 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 153 transitions, 701 flow [2022-11-18 18:33:46,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:46,171 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:46,171 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:46,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-18 18:33:46,172 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:46,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:46,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1817908821, now seen corresponding path program 1 times [2022-11-18 18:33:46,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:46,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041997466] [2022-11-18 18:33:46,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:46,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:46,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:46,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:46,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041997466] [2022-11-18 18:33:46,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041997466] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:46,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:46,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:46,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430144101] [2022-11-18 18:33:46,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:46,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:46,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:46,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:46,690 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 18:33:46,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 153 transitions, 701 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:46,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:46,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 18:33:46,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:48,413 INFO L130 PetriNetUnfolder]: 2005/6195 cut-off events. [2022-11-18 18:33:48,413 INFO L131 PetriNetUnfolder]: For 20911/26100 co-relation queries the response was YES. [2022-11-18 18:33:48,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21211 conditions, 6195 events. 2005/6195 cut-off events. For 20911/26100 co-relation queries the response was YES. Maximal size of possible extension queue 567. Compared 65798 event pairs, 194 based on Foata normal form. 142/5999 useless extension candidates. Maximal degree in co-relation 21127. Up to 1403 conditions per place. [2022-11-18 18:33:48,494 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 79 selfloop transitions, 28 changer transitions 3/233 dead transitions. [2022-11-18 18:33:48,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 233 transitions, 1325 flow [2022-11-18 18:33:48,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-18 18:33:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-18 18:33:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1275 transitions. [2022-11-18 18:33:48,498 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8460517584605176 [2022-11-18 18:33:48,499 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1275 transitions. [2022-11-18 18:33:48,499 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1275 transitions. [2022-11-18 18:33:48,500 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:48,500 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1275 transitions. [2022-11-18 18:33:48,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 115.9090909090909) internal successors, (1275), 11 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:48,506 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:48,508 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 137.0) internal successors, (1644), 12 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:48,508 INFO L175 Difference]: Start difference. First operand has 162 places, 153 transitions, 701 flow. Second operand 11 states and 1275 transitions. [2022-11-18 18:33:48,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 233 transitions, 1325 flow [2022-11-18 18:33:48,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 233 transitions, 1234 flow, removed 38 selfloop flow, removed 4 redundant places. [2022-11-18 18:33:48,754 INFO L231 Difference]: Finished difference. Result has 176 places, 175 transitions, 911 flow [2022-11-18 18:33:48,754 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=911, PETRI_PLACES=176, PETRI_TRANSITIONS=175} [2022-11-18 18:33:48,755 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 32 predicate places. [2022-11-18 18:33:48,755 INFO L495 AbstractCegarLoop]: Abstraction has has 176 places, 175 transitions, 911 flow [2022-11-18 18:33:48,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:48,756 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:48,756 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:48,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-18 18:33:48,757 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:48,757 INFO L85 PathProgramCache]: Analyzing trace with hash -2041505483, now seen corresponding path program 2 times [2022-11-18 18:33:48,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:48,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098849226] [2022-11-18 18:33:48,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:48,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:48,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098849226] [2022-11-18 18:33:48,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098849226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:48,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:48,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:33:48,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919065651] [2022-11-18 18:33:48,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:48,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:33:48,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:48,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:33:48,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:33:48,998 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 18:33:49,090 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 175 transitions, 911 flow. Second operand has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:49,090 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:49,090 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 18:33:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:51,174 INFO L130 PetriNetUnfolder]: 2519/8310 cut-off events. [2022-11-18 18:33:51,174 INFO L131 PetriNetUnfolder]: For 28787/30676 co-relation queries the response was YES. [2022-11-18 18:33:51,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27623 conditions, 8310 events. 2519/8310 cut-off events. For 28787/30676 co-relation queries the response was YES. Maximal size of possible extension queue 776. Compared 97230 event pairs, 259 based on Foata normal form. 129/7907 useless extension candidates. Maximal degree in co-relation 27535. Up to 1387 conditions per place. [2022-11-18 18:33:51,298 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 59 selfloop transitions, 11 changer transitions 0/213 dead transitions. [2022-11-18 18:33:51,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 213 transitions, 1273 flow [2022-11-18 18:33:51,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:33:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 18:33:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 850 transitions. [2022-11-18 18:33:51,304 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.886339937434828 [2022-11-18 18:33:51,304 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 850 transitions. [2022-11-18 18:33:51,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 850 transitions. [2022-11-18 18:33:51,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:51,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 850 transitions. [2022-11-18 18:33:51,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.42857142857143) internal successors, (850), 7 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:51,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:51,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:51,312 INFO L175 Difference]: Start difference. First operand has 176 places, 175 transitions, 911 flow. Second operand 7 states and 850 transitions. [2022-11-18 18:33:51,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 213 transitions, 1273 flow [2022-11-18 18:33:51,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 213 transitions, 1197 flow, removed 38 selfloop flow, removed 0 redundant places. [2022-11-18 18:33:51,542 INFO L231 Difference]: Finished difference. Result has 186 places, 178 transitions, 906 flow [2022-11-18 18:33:51,542 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=835, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=906, PETRI_PLACES=186, PETRI_TRANSITIONS=178} [2022-11-18 18:33:51,543 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 42 predicate places. [2022-11-18 18:33:51,544 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 178 transitions, 906 flow [2022-11-18 18:33:51,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.28571428571429) internal successors, (807), 7 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:51,545 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:51,545 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:51,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-18 18:33:51,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1627992157, now seen corresponding path program 3 times [2022-11-18 18:33:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:51,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022265285] [2022-11-18 18:33:51,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:51,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:51,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:51,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:51,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022265285] [2022-11-18 18:33:51,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022265285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:51,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:51,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-18 18:33:51,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749539696] [2022-11-18 18:33:51,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:51,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-18 18:33:51,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:51,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-18 18:33:51,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-18 18:33:51,881 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 18:33:51,882 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 178 transitions, 906 flow. Second operand has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:51,882 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:51,882 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 18:33:51,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:54,031 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][156], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 243#(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)), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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)), 326#(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)), Black: 217#(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: 204#true, 62#L786true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 129#L869-1true, Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:54,031 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-18 18:33:54,032 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:54,032 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:54,032 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:54,034 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][193], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 247#(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: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 330#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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: 217#(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: 204#true, 132#L791true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, 129#L869-1true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:54,035 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,035 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,035 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,035 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,381 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][156], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 243#(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)), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), 69#L2true, P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 326#(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)), Black: 219#(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: 217#(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: 204#true, 62#L786true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 5#L841true, Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:54,382 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,382 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,382 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,382 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:54,613 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][193], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 247#(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: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 69#L2true, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 330#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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: 217#(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: 204#true, 132#L791true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:54,614 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,614 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,614 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,614 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,739 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][173], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), 245#(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: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 59#L3true, 62#L786true, 328#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 219#(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)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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))]) [2022-11-18 18:33:54,740 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,740 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:33:54,994 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][212], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 132#L791true, 59#L3true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 5#L841true, Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 249#(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: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 245#(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))]) [2022-11-18 18:33:54,995 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 18:33:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:54,995 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:55,026 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][173], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 137#L3-1true, 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), 245#(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: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 328#(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)), 62#L786true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 219#(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)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 5#L841true, Black: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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))]) [2022-11-18 18:33:55,027 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 18:33:55,027 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:55,028 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:55,028 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:33:55,215 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][212], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 137#L3-1true, 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, 101#L811true, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 277#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 132#L791true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 249#(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: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 245#(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))]) [2022-11-18 18:33:55,215 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 18:33:55,216 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:33:55,216 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:33:55,216 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:33:55,841 INFO L130 PetriNetUnfolder]: 9821/19076 cut-off events. [2022-11-18 18:33:55,841 INFO L131 PetriNetUnfolder]: For 105972/114351 co-relation queries the response was YES. [2022-11-18 18:33:55,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75569 conditions, 19076 events. 9821/19076 cut-off events. For 105972/114351 co-relation queries the response was YES. Maximal size of possible extension queue 1552. Compared 190286 event pairs, 405 based on Foata normal form. 406/18765 useless extension candidates. Maximal degree in co-relation 75477. Up to 3178 conditions per place. [2022-11-18 18:33:56,030 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 98 selfloop transitions, 54 changer transitions 46/301 dead transitions. [2022-11-18 18:33:56,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 301 transitions, 2318 flow [2022-11-18 18:33:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-18 18:33:56,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-11-18 18:33:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1940 transitions. [2022-11-18 18:33:56,036 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.885036496350365 [2022-11-18 18:33:56,037 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1940 transitions. [2022-11-18 18:33:56,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1940 transitions. [2022-11-18 18:33:56,038 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:33:56,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1940 transitions. [2022-11-18 18:33:56,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 121.25) internal successors, (1940), 16 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:56,049 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:56,050 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 137.0) internal successors, (2329), 17 states have internal predecessors, (2329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:56,050 INFO L175 Difference]: Start difference. First operand has 186 places, 178 transitions, 906 flow. Second operand 16 states and 1940 transitions. [2022-11-18 18:33:56,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 301 transitions, 2318 flow [2022-11-18 18:33:57,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 301 transitions, 2298 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-11-18 18:33:57,293 INFO L231 Difference]: Finished difference. Result has 203 places, 187 transitions, 1203 flow [2022-11-18 18:33:57,294 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1203, PETRI_PLACES=203, PETRI_TRANSITIONS=187} [2022-11-18 18:33:57,295 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 59 predicate places. [2022-11-18 18:33:57,295 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 187 transitions, 1203 flow [2022-11-18 18:33:57,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.875) internal successors, (911), 8 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:57,296 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:33:57,296 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:33:57,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-18 18:33:57,296 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:33:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:33:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 422948697, now seen corresponding path program 1 times [2022-11-18 18:33:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:33:57,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323012689] [2022-11-18 18:33:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:33:57,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:33:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:33:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:33:57,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:33:57,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323012689] [2022-11-18 18:33:57,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323012689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:33:57,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:33:57,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-18 18:33:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403637286] [2022-11-18 18:33:57,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:33:57,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-18 18:33:57,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:33:57,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-18 18:33:57,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-18 18:33:57,626 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2022-11-18 18:33:57,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 187 transitions, 1203 flow. Second operand has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:33:57,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:33:57,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2022-11-18 18:33:57,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:33:59,757 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][156], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 243#(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)), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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)), 326#(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)), Black: 217#(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: 204#true, 62#L786true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 364#(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)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 129#L869-1true, Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:59,758 INFO L383 tUnfolder$Statistics]: this new event has 90 ancestors and is cut-off event [2022-11-18 18:33:59,758 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:59,758 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:59,758 INFO L386 tUnfolder$Statistics]: existing Event has 90 ancestors and is cut-off event [2022-11-18 18:33:59,760 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][193], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 247#(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: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 330#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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: 217#(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)), 368#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 204#true, 132#L791true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 129#L869-1true, Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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: 245#(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))]) [2022-11-18 18:33:59,760 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 18:33:59,760 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:59,761 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:33:59,761 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:34:00,088 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][156], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 243#(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)), 47#L763true, P0Thread1of1ForFork3InUse, 69#L2true, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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)), 326#(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)), Black: 217#(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: 204#true, 62#L786true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 364#(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)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 249#(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: 245#(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))]) [2022-11-18 18:34:00,088 INFO L383 tUnfolder$Statistics]: this new event has 91 ancestors and is cut-off event [2022-11-18 18:34:00,088 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:34:00,089 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:34:00,089 INFO L386 tUnfolder$Statistics]: existing Event has 91 ancestors and is cut-off event [2022-11-18 18:34:00,564 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][193], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 247#(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: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 69#L2true, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 330#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 219#(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: 217#(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)), 368#(and (<= ~__unbuffered_cnt~0 2) (<= |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: 204#true, 132#L791true, 215#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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: 245#(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))]) [2022-11-18 18:34:00,564 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,564 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,565 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,565 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,572 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][170], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, 366#(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)), P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 245#(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: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 59#L3true, 328#(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)), 62#L786true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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))]) [2022-11-18 18:34:00,572 INFO L383 tUnfolder$Statistics]: this new event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,572 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,573 INFO L386 tUnfolder$Statistics]: existing Event has 92 ancestors and is cut-off event [2022-11-18 18:34:00,783 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][211], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 370#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 132#L791true, 59#L3true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 249#(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: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 245#(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))]) [2022-11-18 18:34:00,783 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,783 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,783 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,783 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,791 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][170], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 137#L3-1true, 47#L763true, 366#(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)), P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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: 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), 245#(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: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 328#(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)), 62#L786true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 249#(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))]) [2022-11-18 18:34:00,791 INFO L383 tUnfolder$Statistics]: this new event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,791 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,791 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,791 INFO L386 tUnfolder$Statistics]: existing Event has 93 ancestors and is cut-off event [2022-11-18 18:34:00,990 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([400] L834-->L841: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_119 256) 0))) (.cse5 (not (= 0 (mod v_~y$r_buff0_thd4~0_22 256))))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_120 256) 0)))) (.cse2 (and .cse4 .cse5)) (.cse1 (and (not (= (mod v_~y$w_buff1_used~0_105 256) 0)) .cse3))) (and (= (ite .cse0 v_~y$w_buff0~0_50 (ite .cse1 v_~y$w_buff1~0_39 v_~y~0_71)) v_~y~0_70) (= v_~y$r_buff0_thd4~0_21 (ite .cse2 0 v_~y$r_buff0_thd4~0_22)) (= (ite (or (and (not (= (mod v_~y$w_buff1_used~0_104 256) 0)) .cse3) (and .cse4 (not (= (mod v_~y$r_buff0_thd4~0_21 256) 0)))) 0 v_~y$r_buff1_thd4~0_20) v_~y$r_buff1_thd4~0_19) (= v_~y$w_buff0_used~0_119 (ite .cse0 0 v_~y$w_buff0_used~0_120)) (= (ite (or .cse2 .cse1) 0 v_~y$w_buff1_used~0_105) v_~y$w_buff1_used~0_104)))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_22, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_120, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_105} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_21, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_119, ~y$w_buff1~0=v_~y$w_buff1~0_39, ~y$w_buff0~0=v_~y$w_buff0~0_50, ~y~0=v_~y~0_70, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_104} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][211], [Black: 237#(and (<= ~__unbuffered_cnt~0 1) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 370#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 181#(= ~__unbuffered_p3_EAX~0 0), 137#L3-1true, 47#L763true, P0Thread1of1ForFork3InUse, 265#(and (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)))), P3Thread1of1ForFork0InUse, Black: 336#(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)), 101#L811true, P1Thread1of1ForFork1InUse, Black: 312#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 307#true, P2Thread1of1ForFork2InUse, Black: 271#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 269#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 259#(= ~a~0 1), Black: 275#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 211#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 267#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 273#(and (<= 1 ~main$tmp_guard1~0) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 213#(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: 207#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 217#(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: 204#true, 132#L791true, 219#(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: 162#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 164#(and (<= 1 ~main$tmp_guard1~0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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|))), 295#(and (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1)), Black: 157#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), Black: 297#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 299#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 5#L841true, Black: 168#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)) (not (= ~__unbuffered_p0_EAX~0 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: 301#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (= ~__unbuffered_p3_EBX~0 1) (= ~a~0 1) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 332#(and (<= ~__unbuffered_cnt~0 2) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 249#(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: 227#true, Black: 231#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 243#(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)), Black: 245#(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))]) [2022-11-18 18:34:00,991 INFO L383 tUnfolder$Statistics]: this new event has 94 ancestors and is cut-off event [2022-11-18 18:34:00,991 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:34:00,991 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:34:00,991 INFO L386 tUnfolder$Statistics]: existing Event has 94 ancestors and is cut-off event [2022-11-18 18:34:01,487 INFO L130 PetriNetUnfolder]: 9532/18376 cut-off events. [2022-11-18 18:34:01,488 INFO L131 PetriNetUnfolder]: For 125464/133543 co-relation queries the response was YES. [2022-11-18 18:34:01,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80389 conditions, 18376 events. 9532/18376 cut-off events. For 125464/133543 co-relation queries the response was YES. Maximal size of possible extension queue 1577. Compared 183249 event pairs, 578 based on Foata normal form. 267/17901 useless extension candidates. Maximal degree in co-relation 80354. Up to 2944 conditions per place. [2022-11-18 18:34:01,711 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 71 selfloop transitions, 55 changer transitions 58/287 dead transitions. [2022-11-18 18:34:01,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 287 transitions, 2352 flow [2022-11-18 18:34:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-18 18:34:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-11-18 18:34:01,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2265 transitions. [2022-11-18 18:34:01,717 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.870149827122551 [2022-11-18 18:34:01,717 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2265 transitions. [2022-11-18 18:34:01,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2265 transitions. [2022-11-18 18:34:01,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:34:01,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2265 transitions. [2022-11-18 18:34:01,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 119.21052631578948) internal successors, (2265), 19 states have internal predecessors, (2265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:01,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:01,732 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 137.0) internal successors, (2740), 20 states have internal predecessors, (2740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:01,732 INFO L175 Difference]: Start difference. First operand has 203 places, 187 transitions, 1203 flow. Second operand 19 states and 2265 transitions. [2022-11-18 18:34:01,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 287 transitions, 2352 flow [2022-11-18 18:34:05,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 287 transitions, 1785 flow, removed 245 selfloop flow, removed 18 redundant places. [2022-11-18 18:34:05,118 INFO L231 Difference]: Finished difference. Result has 201 places, 180 transitions, 954 flow [2022-11-18 18:34:05,118 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=954, PETRI_PLACES=201, PETRI_TRANSITIONS=180} [2022-11-18 18:34:05,119 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 57 predicate places. [2022-11-18 18:34:05,119 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 180 transitions, 954 flow [2022-11-18 18:34:05,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 113.88888888888889) internal successors, (1025), 9 states have internal predecessors, (1025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:05,120 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:34:05,120 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:05,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-18 18:34:05,121 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:34:05,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1700402187, now seen corresponding path program 1 times [2022-11-18 18:34:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:05,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784142292] [2022-11-18 18:34:05,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:05,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:05,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:34:05,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:05,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784142292] [2022-11-18 18:34:05,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784142292] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:05,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:05,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:05,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548192389] [2022-11-18 18:34:05,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:05,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:34:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:34:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:34:05,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 137 [2022-11-18 18:34:05,483 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 180 transitions, 954 flow. Second operand has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:05,483 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:34:05,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 137 [2022-11-18 18:34:05,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:34:07,389 INFO L130 PetriNetUnfolder]: 3116/10814 cut-off events. [2022-11-18 18:34:07,390 INFO L131 PetriNetUnfolder]: For 25187/26126 co-relation queries the response was YES. [2022-11-18 18:34:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34714 conditions, 10814 events. 3116/10814 cut-off events. For 25187/26126 co-relation queries the response was YES. Maximal size of possible extension queue 1275. Compared 143058 event pairs, 83 based on Foata normal form. 1/10197 useless extension candidates. Maximal degree in co-relation 34683. Up to 1177 conditions per place. [2022-11-18 18:34:07,523 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 39 selfloop transitions, 11 changer transitions 21/216 dead transitions. [2022-11-18 18:34:07,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 216 transitions, 1296 flow [2022-11-18 18:34:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-18 18:34:07,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-18 18:34:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 907 transitions. [2022-11-18 18:34:07,526 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8275547445255474 [2022-11-18 18:34:07,526 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 907 transitions. [2022-11-18 18:34:07,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 907 transitions. [2022-11-18 18:34:07,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:34:07,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 907 transitions. [2022-11-18 18:34:07,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.375) internal successors, (907), 8 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:07,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:07,532 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 137.0) internal successors, (1233), 9 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:07,532 INFO L175 Difference]: Start difference. First operand has 201 places, 180 transitions, 954 flow. Second operand 8 states and 907 transitions. [2022-11-18 18:34:07,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 216 transitions, 1296 flow [2022-11-18 18:34:08,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 216 transitions, 1147 flow, removed 34 selfloop flow, removed 17 redundant places. [2022-11-18 18:34:08,427 INFO L231 Difference]: Finished difference. Result has 193 places, 180 transitions, 876 flow [2022-11-18 18:34:08,428 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=876, PETRI_PLACES=193, PETRI_TRANSITIONS=180} [2022-11-18 18:34:08,428 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 49 predicate places. [2022-11-18 18:34:08,429 INFO L495 AbstractCegarLoop]: Abstraction has has 193 places, 180 transitions, 876 flow [2022-11-18 18:34:08,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.71428571428571) internal successors, (768), 7 states have internal predecessors, (768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:08,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:34:08,429 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-18 18:34:08,430 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:34:08,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:08,430 INFO L85 PathProgramCache]: Analyzing trace with hash -955763423, now seen corresponding path program 2 times [2022-11-18 18:34:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928489259] [2022-11-18 18:34:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:34:08,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928489259] [2022-11-18 18:34:08,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928489259] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:08,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:08,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-18 18:34:08,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002776107] [2022-11-18 18:34:08,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:08,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-18 18:34:08,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-18 18:34:08,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-18 18:34:08,728 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2022-11-18 18:34:08,729 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 180 transitions, 876 flow. Second operand has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:08,729 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:34:08,729 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2022-11-18 18:34:08,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:34:09,770 INFO L130 PetriNetUnfolder]: 1855/6675 cut-off events. [2022-11-18 18:34:09,771 INFO L131 PetriNetUnfolder]: For 11304/11462 co-relation queries the response was YES. [2022-11-18 18:34:09,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18853 conditions, 6675 events. 1855/6675 cut-off events. For 11304/11462 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 82927 event pairs, 25 based on Foata normal form. 2/6269 useless extension candidates. Maximal degree in co-relation 18823. Up to 812 conditions per place. [2022-11-18 18:34:09,819 INFO L137 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 1 changer transitions 20/196 dead transitions. [2022-11-18 18:34:09,819 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 196 transitions, 1010 flow [2022-11-18 18:34:09,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-18 18:34:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-18 18:34:09,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 828 transitions. [2022-11-18 18:34:09,821 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8633993743482794 [2022-11-18 18:34:09,822 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 828 transitions. [2022-11-18 18:34:09,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 828 transitions. [2022-11-18 18:34:09,822 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:34:09,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 828 transitions. [2022-11-18 18:34:09,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.28571428571429) internal successors, (828), 7 states have internal predecessors, (828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:09,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:09,827 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 137.0) internal successors, (1096), 8 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:09,827 INFO L175 Difference]: Start difference. First operand has 193 places, 180 transitions, 876 flow. Second operand 7 states and 828 transitions. [2022-11-18 18:34:09,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 196 transitions, 1010 flow [2022-11-18 18:34:10,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 196 transitions, 986 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-18 18:34:10,232 INFO L231 Difference]: Finished difference. Result has 194 places, 173 transitions, 808 flow [2022-11-18 18:34:10,233 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=860, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=808, PETRI_PLACES=194, PETRI_TRANSITIONS=173} [2022-11-18 18:34:10,234 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 50 predicate places. [2022-11-18 18:34:10,234 INFO L495 AbstractCegarLoop]: Abstraction has has 194 places, 173 transitions, 808 flow [2022-11-18 18:34:10,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.71428571428571) internal successors, (810), 7 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:10,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:34:10,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:10,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-18 18:34:10,235 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:34:10,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:10,235 INFO L85 PathProgramCache]: Analyzing trace with hash 940871649, now seen corresponding path program 3 times [2022-11-18 18:34:10,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:10,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975700794] [2022-11-18 18:34:10,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:10,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-18 18:34:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-18 18:34:12,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-18 18:34:12,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975700794] [2022-11-18 18:34:12,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975700794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-18 18:34:12,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-18 18:34:12,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-18 18:34:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679136759] [2022-11-18 18:34:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-18 18:34:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-18 18:34:12,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-18 18:34:12,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-18 18:34:12,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-11-18 18:34:12,047 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 137 [2022-11-18 18:34:12,059 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 173 transitions, 808 flow. Second operand has 13 states, 13 states have (on average 108.92307692307692) internal successors, (1416), 13 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:12,068 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-18 18:34:12,069 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 137 [2022-11-18 18:34:12,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-18 18:34:13,022 INFO L130 PetriNetUnfolder]: 1001/3558 cut-off events. [2022-11-18 18:34:13,022 INFO L131 PetriNetUnfolder]: For 6350/6472 co-relation queries the response was YES. [2022-11-18 18:34:13,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10206 conditions, 3558 events. 1001/3558 cut-off events. For 6350/6472 co-relation queries the response was YES. Maximal size of possible extension queue 437. Compared 38905 event pairs, 10 based on Foata normal form. 1/3346 useless extension candidates. Maximal degree in co-relation 10175. Up to 430 conditions per place. [2022-11-18 18:34:13,056 INFO L137 encePairwiseOnDemand]: 126/137 looper letters, 23 selfloop transitions, 7 changer transitions 8/186 dead transitions. [2022-11-18 18:34:13,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 186 transitions, 936 flow [2022-11-18 18:34:13,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-18 18:34:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-11-18 18:34:13,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1323 transitions. [2022-11-18 18:34:13,059 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8047445255474452 [2022-11-18 18:34:13,060 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1323 transitions. [2022-11-18 18:34:13,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1323 transitions. [2022-11-18 18:34:13,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-18 18:34:13,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1323 transitions. [2022-11-18 18:34:13,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 110.25) internal successors, (1323), 12 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:13,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:13,068 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 137.0) internal successors, (1781), 13 states have internal predecessors, (1781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:13,068 INFO L175 Difference]: Start difference. First operand has 194 places, 173 transitions, 808 flow. Second operand 12 states and 1323 transitions. [2022-11-18 18:34:13,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 186 transitions, 936 flow [2022-11-18 18:34:13,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 903 flow, removed 14 selfloop flow, removed 7 redundant places. [2022-11-18 18:34:13,241 INFO L231 Difference]: Finished difference. Result has 198 places, 174 transitions, 820 flow [2022-11-18 18:34:13,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=787, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=820, PETRI_PLACES=198, PETRI_TRANSITIONS=174} [2022-11-18 18:34:13,242 INFO L288 CegarLoopForPetriNet]: 144 programPoint places, 54 predicate places. [2022-11-18 18:34:13,242 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 174 transitions, 820 flow [2022-11-18 18:34:13,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 108.92307692307692) internal successors, (1416), 13 states have internal predecessors, (1416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-18 18:34:13,243 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-18 18:34:13,243 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:13,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-18 18:34:13,244 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-18 18:34:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-18 18:34:13,244 INFO L85 PathProgramCache]: Analyzing trace with hash -372731595, now seen corresponding path program 4 times [2022-11-18 18:34:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-18 18:34:13,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871865633] [2022-11-18 18:34:13,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-18 18:34:13,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-18 18:34:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:34:13,300 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-18 18:34:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-18 18:34:13,401 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-18 18:34:13,401 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-18 18:34:13,403 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-18 18:34:13,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-18 18:34:13,405 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-18 18:34:13,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-18 18:34:13,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-18 18:34:13,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-18 18:34:13,406 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-18 18:34:13,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-18 18:34:13,407 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1, 1] [2022-11-18 18:34:13,415 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-18 18:34:13,415 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-18 18:34:13,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 06:34:13 BasicIcfg [2022-11-18 18:34:13,556 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-18 18:34:13,557 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-18 18:34:13,557 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-18 18:34:13,557 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-18 18:34:13,558 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 06:33:36" (3/4) ... [2022-11-18 18:34:13,560 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-18 18:34:13,764 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/witness.graphml [2022-11-18 18:34:13,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-18 18:34:13,766 INFO L158 Benchmark]: Toolchain (without parser) took 38640.32ms. Allocated memory was 132.1MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 90.0MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-18 18:34:13,766 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 132.1MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-18 18:34:13,767 INFO L158 Benchmark]: CACSL2BoogieTranslator took 636.61ms. Allocated memory is still 132.1MB. Free memory was 89.8MB in the beginning and 91.9MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,767 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.07ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,768 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,769 INFO L158 Benchmark]: RCFGBuilder took 935.89ms. Allocated memory is still 132.1MB. Free memory was 87.2MB in the beginning and 104.9MB in the end (delta: -17.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,769 INFO L158 Benchmark]: TraceAbstraction took 36770.94ms. Allocated memory was 132.1MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 104.2MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 993.9MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,770 INFO L158 Benchmark]: Witness Printer took 208.10ms. Allocated memory is still 9.7GB. Free memory was 8.7GB in the beginning and 8.7GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-11-18 18:34:13,775 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.29ms. Allocated memory is still 132.1MB. Free memory is still 108.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 636.61ms. Allocated memory is still 132.1MB. Free memory was 89.8MB in the beginning and 91.9MB in the end (delta: -2.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.07ms. Allocated memory is still 132.1MB. Free memory was 91.9MB in the beginning and 89.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 132.1MB. Free memory was 89.3MB in the beginning and 87.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 935.89ms. Allocated memory is still 132.1MB. Free memory was 87.2MB in the beginning and 104.9MB in the end (delta: -17.7MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 36770.94ms. Allocated memory was 132.1MB in the beginning and 9.7GB in the end (delta: 9.6GB). Free memory was 104.2MB in the beginning and 8.7GB in the end (delta: -8.6GB). Peak memory consumption was 993.9MB. Max. memory is 16.1GB. * Witness Printer took 208.10ms. Allocated memory is still 9.7GB. Free memory was 8.7GB in the beginning and 8.7GB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L749] 0 _Bool weak$$choice0; VAL [weak$$choice0=0] [L750] 0 _Bool weak$$choice2; VAL [weak$$choice0=0, weak$$choice2=0] [L743] 0 int y$w_buff0; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0] [L745] 0 int y$w_buff1; VAL [weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$w_buff0=0, y$w_buff1=0] [L733] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$w_buff0=0, y$w_buff1=0] [L734] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L730] 0 int y$mem_tmp; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$w_buff0=0, y$w_buff1=0] [L735] 0 _Bool y$r_buff0_thd4; VAL [__unbuffered_p0_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$w_buff0=0, y$w_buff1=0] [L714] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$w_buff0=0, y$w_buff1=0] [L720] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$w_buff0=0, y$w_buff1=0] [L731] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$w_buff0=0, y$w_buff1=0] [L732] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$w_buff0=0, y$w_buff1=0] [L741] 0 _Bool y$read_delayed; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L722] 0 int a = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L729] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0] [L746] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=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_buff0_thd4=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] [L726] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=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] [L736] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=0, y$r_buff1_thd0=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] [L728] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=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] [L738] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd2=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] [L748] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd2=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] [L737] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L740] 0 _Bool y$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd4=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] [L739] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L858] 0 pthread_t t437; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t437={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L859] FCALL, FORK 0 pthread_create(&t437, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t437, ((void *)0), P0, ((void *)0))=-3, t437={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L860] 0 pthread_t t438; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L861] FCALL, FORK 0 pthread_create(&t438, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t438, ((void *)0), P1, ((void *)0))=-2, t437={5:0}, t438={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L862] 0 pthread_t t439; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L863] FCALL, FORK 0 pthread_create(&t439, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t439, ((void *)0), P2, ((void *)0))=-1, t437={5:0}, t438={6:0}, t439={7: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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L864] 0 pthread_t t440; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L865] FCALL, FORK 0 pthread_create(&t440, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t440, ((void *)0), P3, ((void *)0))=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={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_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L797] 3 y$w_buff1 = y$w_buff0 [L798] 3 y$w_buff0 = 1 [L799] 3 y$w_buff1_used = y$w_buff0_used [L800] 3 y$w_buff0_used = (_Bool)1 [L801] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L801] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L802] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L803] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L804] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L805] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L806] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L807] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L810] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L827] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L830] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L833] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, 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=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=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L772] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 2 y$flush_delayed = weak$$choice2 [L775] 2 y$mem_tmp = y [L776] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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] [L836] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L837] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L838] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L839] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L840] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L815] 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 [L816] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L817] 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 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L820] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L790] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 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) [L872] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L873] 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 [L874] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L875] 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 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L878] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_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=1, main$tmp_guard1=0, t437={5:0}, t438={6:0}, t439={7:0}, t440={3:0}, weak$$choice0=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L880] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, 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=49, weak$$choice2=255, 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=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=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=1] - UnprovableResult [Line: 18]: 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: 859]: 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: 865]: 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: 861]: 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: 863]: 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 9 procedures, 172 locations, 7 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: 36.4s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 950 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 950 mSDsluCounter, 632 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 498 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1660 IncrementalHoareTripleChecker+Invalid, 1712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 134 mSDtfsCounter, 1660 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 157 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=8, InterpolantAutomatonStates: 124, 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.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 1241 NumberOfCodeBlocks, 1241 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1123 ConstructedInterpolants, 0 QuantifiedInterpolants, 5028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11-18 18:34:13,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8605abef-7cbc-4626-b707-e6237f4a2a09/bin/uautomizer-TMbwUNV5ro/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