/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-0612a5f-m [2022-09-20 20:33:35,782 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 20:33:35,783 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 20:33:35,806 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 20:33:35,806 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 20:33:35,807 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 20:33:35,808 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 20:33:35,809 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 20:33:35,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 20:33:35,811 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 20:33:35,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 20:33:35,817 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 20:33:35,817 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 20:33:35,820 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 20:33:35,821 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 20:33:35,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 20:33:35,823 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 20:33:35,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 20:33:35,829 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 20:33:35,834 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 20:33:35,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 20:33:35,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 20:33:35,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 20:33:35,838 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 20:33:35,841 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 20:33:35,841 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 20:33:35,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 20:33:35,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 20:33:35,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 20:33:35,843 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 20:33:35,843 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 20:33:35,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 20:33:35,843 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 20:33:35,844 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 20:33:35,844 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 20:33:35,844 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 20:33:35,845 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 20:33:35,845 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 20:33:35,845 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 20:33:35,846 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 20:33:35,846 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 20:33:35,847 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 20:33:35,859 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 20:33:35,859 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 20:33:35,859 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 20:33:35,859 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 20:33:35,860 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 20:33:35,860 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 20:33:35,860 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 20:33:35,860 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 20:33:35,860 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 20:33:35,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 20:33:35,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 20:33:35,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 20:33:35,862 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:33:35,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 20:33:35,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 20:33:35,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 20:33:35,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 20:33:35,863 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 20:33:35,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 20:33:35,863 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2022-09-20 20:33:35,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 20:33:36,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 20:33:36,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 20:33:36,014 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 20:33:36,015 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 20:33:36,016 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:33:36,057 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f3a68ec/c40b7a3de7cd444c868669d26ff98fe4/FLAG7b39ab9ea [2022-09-20 20:33:36,478 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 20:33:36,478 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:33:36,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f3a68ec/c40b7a3de7cd444c868669d26ff98fe4/FLAG7b39ab9ea [2022-09-20 20:33:36,880 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f3a68ec/c40b7a3de7cd444c868669d26ff98fe4 [2022-09-20 20:33:36,882 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 20:33:36,884 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 20:33:36,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 20:33:36,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 20:33:36,894 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 20:33:36,895 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:33:36" (1/1) ... [2022-09-20 20:33:36,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e2dc5aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:36, skipping insertion in model container [2022-09-20 20:33:36,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 08:33:36" (1/1) ... [2022-09-20 20:33:36,902 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 20:33:36,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 20:33:37,126 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-09-20 20:33:37,295 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:33:37,301 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 20:33:37,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix024_power.opt_pso.opt_rmo.opt.i[1009,1022] [2022-09-20 20:33:37,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 20:33:37,373 INFO L208 MainTranslator]: Completed translation [2022-09-20 20:33:37,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37 WrapperNode [2022-09-20 20:33:37,374 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 20:33:37,375 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 20:33:37,375 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 20:33:37,375 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 20:33:37,379 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,403 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,425 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 179 [2022-09-20 20:33:37,426 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 20:33:37,426 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 20:33:37,426 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 20:33:37,426 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 20:33:37,441 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,452 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,457 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,459 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 20:33:37,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 20:33:37,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 20:33:37,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 20:33:37,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (1/1) ... [2022-09-20 20:33:37,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 20:33:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 20:33:37,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 20:33:37,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 20:33:37,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 20:33:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 20:33:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 20:33:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 20:33:37,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 20:33:37,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 20:33:37,550 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 20:33:37,633 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 20:33:37,634 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 20:33:37,996 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 20:33:38,254 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 20:33:38,254 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 20:33:38,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:33:38 BoogieIcfgContainer [2022-09-20 20:33:38,256 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 20:33:38,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 20:33:38,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 20:33:38,260 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 20:33:38,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 08:33:36" (1/3) ... [2022-09-20 20:33:38,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8c487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:33:38, skipping insertion in model container [2022-09-20 20:33:38,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 08:33:37" (2/3) ... [2022-09-20 20:33:38,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8c487e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 08:33:38, skipping insertion in model container [2022-09-20 20:33:38,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 08:33:38" (3/3) ... [2022-09-20 20:33:38,263 INFO L112 eAbstractionObserver]: Analyzing ICFG mix024_power.opt_pso.opt_rmo.opt.i [2022-09-20 20:33:38,276 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 20:33:38,276 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 20:33:38,276 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 20:33:38,328 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 20:33:38,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-09-20 20:33:38,405 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-09-20 20:33:38,405 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:33:38,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 65 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2022-09-20 20:33:38,409 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-09-20 20:33:38,412 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-09-20 20:33:38,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 20:33:38,432 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=false, 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;@4a628c69, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 20:33:38,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-09-20 20:33:38,449 INFO L130 PetriNetUnfolder]: 0/64 cut-off events. [2022-09-20 20:33:38,450 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 20:33:38,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:38,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:38,452 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:38,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:38,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1057251517, now seen corresponding path program 1 times [2022-09-20 20:33:38,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:38,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572779315] [2022-09-20 20:33:38,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:38,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:38,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:38,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:38,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572779315] [2022-09-20 20:33:38,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572779315] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:38,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:38,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 20:33:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360832551] [2022-09-20 20:33:38,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:38,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 20:33:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 20:33:38,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 20:33:38,743 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 120 [2022-09-20 20:33:38,747 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 117 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:38,748 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:38,748 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 120 [2022-09-20 20:33:38,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:38,870 INFO L130 PetriNetUnfolder]: 37/298 cut-off events. [2022-09-20 20:33:38,870 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-09-20 20:33:38,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 298 events. 37/298 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1157 event pairs, 19 based on Foata normal form. 10/289 useless extension candidates. Maximal degree in co-relation 336. Up to 51 conditions per place. [2022-09-20 20:33:38,874 INFO L137 encePairwiseOnDemand]: 115/120 looper letters, 11 selfloop transitions, 2 changer transitions 0/117 dead transitions. [2022-09-20 20:33:38,874 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 117 transitions, 272 flow [2022-09-20 20:33:38,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 20:33:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 20:33:38,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-09-20 20:33:38,887 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2022-09-20 20:33:38,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-09-20 20:33:38,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-09-20 20:33:38,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:38,892 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-09-20 20:33:38,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:38,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:38,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:38,901 INFO L175 Difference]: Start difference. First operand has 125 places, 117 transitions, 243 flow. Second operand 3 states and 339 transitions. [2022-09-20 20:33:38,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 117 transitions, 272 flow [2022-09-20 20:33:38,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 117 transitions, 268 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-09-20 20:33:38,909 INFO L231 Difference]: Finished difference. Result has 122 places, 113 transitions, 236 flow [2022-09-20 20:33:38,911 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=122, PETRI_TRANSITIONS=113} [2022-09-20 20:33:38,913 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, -3 predicate places. [2022-09-20 20:33:38,914 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 113 transitions, 236 flow [2022-09-20 20:33:38,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:38,914 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:38,915 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:38,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 20:33:38,915 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:38,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:38,915 INFO L85 PathProgramCache]: Analyzing trace with hash -233584859, now seen corresponding path program 1 times [2022-09-20 20:33:38,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:38,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158783043] [2022-09-20 20:33:38,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:39,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:39,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:39,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158783043] [2022-09-20 20:33:39,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158783043] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:39,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:39,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:33:39,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037451349] [2022-09-20 20:33:39,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:39,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:33:39,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:39,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:33:39,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:33:39,217 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-09-20 20:33:39,218 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 113 transitions, 236 flow. Second operand has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:39,218 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:39,218 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-09-20 20:33:39,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:40,041 INFO L130 PetriNetUnfolder]: 1698/4149 cut-off events. [2022-09-20 20:33:40,042 INFO L131 PetriNetUnfolder]: For 162/162 co-relation queries the response was YES. [2022-09-20 20:33:40,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6936 conditions, 4149 events. 1698/4149 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 34293 event pairs, 232 based on Foata normal form. 0/4044 useless extension candidates. Maximal degree in co-relation 6877. Up to 950 conditions per place. [2022-09-20 20:33:40,064 INFO L137 encePairwiseOnDemand]: 108/120 looper letters, 32 selfloop transitions, 8 changer transitions 84/201 dead transitions. [2022-09-20 20:33:40,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 201 transitions, 652 flow [2022-09-20 20:33:40,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:33:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:33:40,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1299 transitions. [2022-09-20 20:33:40,068 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8326923076923077 [2022-09-20 20:33:40,068 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1299 transitions. [2022-09-20 20:33:40,068 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1299 transitions. [2022-09-20 20:33:40,069 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:40,069 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1299 transitions. [2022-09-20 20:33:40,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.92307692307692) internal successors, (1299), 13 states have internal predecessors, (1299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,076 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,076 INFO L175 Difference]: Start difference. First operand has 122 places, 113 transitions, 236 flow. Second operand 13 states and 1299 transitions. [2022-09-20 20:33:40,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 201 transitions, 652 flow [2022-09-20 20:33:40,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 201 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 20:33:40,081 INFO L231 Difference]: Finished difference. Result has 144 places, 105 transitions, 302 flow [2022-09-20 20:33:40,082 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=302, PETRI_PLACES=144, PETRI_TRANSITIONS=105} [2022-09-20 20:33:40,082 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 19 predicate places. [2022-09-20 20:33:40,083 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 105 transitions, 302 flow [2022-09-20 20:33:40,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.14285714285714) internal successors, (652), 7 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:40,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:40,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 20:33:40,084 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:40,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:40,084 INFO L85 PathProgramCache]: Analyzing trace with hash 134879073, now seen corresponding path program 1 times [2022-09-20 20:33:40,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:40,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839562581] [2022-09-20 20:33:40,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:40,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:40,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:40,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:40,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:40,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839562581] [2022-09-20 20:33:40,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839562581] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:40,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:40,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:33:40,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716887501] [2022-09-20 20:33:40,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:40,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:33:40,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:40,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:33:40,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:33:40,242 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-09-20 20:33:40,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 105 transitions, 302 flow. Second operand has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:40,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-09-20 20:33:40,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:40,767 INFO L130 PetriNetUnfolder]: 1010/2158 cut-off events. [2022-09-20 20:33:40,768 INFO L131 PetriNetUnfolder]: For 4344/4344 co-relation queries the response was YES. [2022-09-20 20:33:40,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6621 conditions, 2158 events. 1010/2158 cut-off events. For 4344/4344 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 13955 event pairs, 312 based on Foata normal form. 54/2118 useless extension candidates. Maximal degree in co-relation 6546. Up to 677 conditions per place. [2022-09-20 20:33:40,779 INFO L137 encePairwiseOnDemand]: 109/120 looper letters, 41 selfloop transitions, 10 changer transitions 64/192 dead transitions. [2022-09-20 20:33:40,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 192 transitions, 978 flow [2022-09-20 20:33:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:33:40,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:33:40,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1290 transitions. [2022-09-20 20:33:40,782 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8269230769230769 [2022-09-20 20:33:40,782 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1290 transitions. [2022-09-20 20:33:40,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1290 transitions. [2022-09-20 20:33:40,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:40,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1290 transitions. [2022-09-20 20:33:40,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 99.23076923076923) internal successors, (1290), 13 states have internal predecessors, (1290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,787 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,787 INFO L175 Difference]: Start difference. First operand has 144 places, 105 transitions, 302 flow. Second operand 13 states and 1290 transitions. [2022-09-20 20:33:40,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 192 transitions, 978 flow [2022-09-20 20:33:40,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 192 transitions, 926 flow, removed 24 selfloop flow, removed 4 redundant places. [2022-09-20 20:33:40,797 INFO L231 Difference]: Finished difference. Result has 143 places, 111 transitions, 411 flow [2022-09-20 20:33:40,797 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=411, PETRI_PLACES=143, PETRI_TRANSITIONS=111} [2022-09-20 20:33:40,798 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 18 predicate places. [2022-09-20 20:33:40,798 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 111 transitions, 411 flow [2022-09-20 20:33:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:40,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:40,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 20:33:40,799 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:40,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1777426391, now seen corresponding path program 1 times [2022-09-20 20:33:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:40,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126023587] [2022-09-20 20:33:40,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:40,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:40,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:40,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:40,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126023587] [2022-09-20 20:33:40,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126023587] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:40,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:40,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 20:33:40,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372383678] [2022-09-20 20:33:40,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:40,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 20:33:40,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:40,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 20:33:40,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 20:33:40,867 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-09-20 20:33:40,868 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 111 transitions, 411 flow. Second operand has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:40,868 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:40,868 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-09-20 20:33:40,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:41,568 INFO L130 PetriNetUnfolder]: 2180/4466 cut-off events. [2022-09-20 20:33:41,569 INFO L131 PetriNetUnfolder]: For 9481/11024 co-relation queries the response was YES. [2022-09-20 20:33:41,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11525 conditions, 4466 events. 2180/4466 cut-off events. For 9481/11024 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 35394 event pairs, 215 based on Foata normal form. 39/4192 useless extension candidates. Maximal degree in co-relation 11444. Up to 1173 conditions per place. [2022-09-20 20:33:41,593 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 65 selfloop transitions, 17 changer transitions 13/185 dead transitions. [2022-09-20 20:33:41,594 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 185 transitions, 963 flow [2022-09-20 20:33:41,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 20:33:41,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 20:33:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1051 transitions. [2022-09-20 20:33:41,596 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8758333333333334 [2022-09-20 20:33:41,596 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1051 transitions. [2022-09-20 20:33:41,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1051 transitions. [2022-09-20 20:33:41,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:41,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1051 transitions. [2022-09-20 20:33:41,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 105.1) internal successors, (1051), 10 states have internal predecessors, (1051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:41,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:41,601 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 120.0) internal successors, (1320), 11 states have internal predecessors, (1320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:41,601 INFO L175 Difference]: Start difference. First operand has 143 places, 111 transitions, 411 flow. Second operand 10 states and 1051 transitions. [2022-09-20 20:33:41,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 185 transitions, 963 flow [2022-09-20 20:33:41,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 185 transitions, 930 flow, removed 15 selfloop flow, removed 7 redundant places. [2022-09-20 20:33:41,611 INFO L231 Difference]: Finished difference. Result has 142 places, 126 transitions, 498 flow [2022-09-20 20:33:41,611 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=498, PETRI_PLACES=142, PETRI_TRANSITIONS=126} [2022-09-20 20:33:41,612 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 17 predicate places. [2022-09-20 20:33:41,612 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 126 transitions, 498 flow [2022-09-20 20:33:41,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:41,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:41,617 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:41,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 20:33:41,617 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:41,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:41,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1074708796, now seen corresponding path program 1 times [2022-09-20 20:33:41,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:41,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638725984] [2022-09-20 20:33:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:41,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:41,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:41,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:41,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638725984] [2022-09-20 20:33:41,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638725984] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:41,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:41,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:33:41,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22370569] [2022-09-20 20:33:41,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:33:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:41,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:33:41,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:33:41,752 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-09-20 20:33:41,753 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 126 transitions, 498 flow. Second operand has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:41,753 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:41,753 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-09-20 20:33:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:42,249 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][128], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 115#L853-1true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,249 INFO L383 tUnfolder$Statistics]: this new event has 80 ancestors and is cut-off event [2022-09-20 20:33:42,249 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 20:33:42,250 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 20:33:42,250 INFO L386 tUnfolder$Statistics]: existing Event has 80 ancestors and is cut-off event [2022-09-20 20:33:42,251 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][165], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 250#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 115#L853-1true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,251 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,251 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,251 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,251 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,293 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][128], [60#L3true, P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 246#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,294 INFO L383 tUnfolder$Statistics]: this new event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,294 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,294 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,294 INFO L386 tUnfolder$Statistics]: existing Event has 81 ancestors and is cut-off event [2022-09-20 20:33:42,308 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][165], [60#L3true, P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 250#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,308 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,308 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,308 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,308 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,322 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,322 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,322 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,322 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,322 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,331 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,332 INFO L383 tUnfolder$Statistics]: this new event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,332 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,332 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,332 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,332 INFO L386 tUnfolder$Statistics]: existing Event has 82 ancestors and is cut-off event [2022-09-20 20:33:42,342 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,342 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,342 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,342 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,342 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,353 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1))), P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,353 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,353 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,353 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,353 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,363 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][141], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 68#L773true, Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), 248#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= ~__unbuffered_cnt~0 1) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-09-20 20:33:42,363 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,363 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,364 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,364 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,364 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,365 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 171#true, 78#L4true, 12#L807true, 135#true, 207#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2022-09-20 20:33:42,365 INFO L383 tUnfolder$Statistics]: this new event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,365 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,365 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,365 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,365 INFO L386 tUnfolder$Statistics]: existing Event has 83 ancestors and is cut-off event [2022-09-20 20:33:42,373 INFO L381 tUnfolder$Statistics]: inserting event number 4 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 137#(= ~__unbuffered_p2_EAX~0 0), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-09-20 20:33:42,373 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,373 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,373 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,373 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,384 INFO L381 tUnfolder$Statistics]: inserting event number 5 for the transition-marking pair ([909] L820-->L827: Formula: (let ((.cse13 (= (mod v_~y$w_buff0_used~0_324 256) 0)) (.cse14 (= (mod v_~y$w_buff1_used~0_234 256) 0)) (.cse5 (= (mod v_~y$r_buff1_thd3~0_56 256) 0)) (.cse12 (= (mod v_~y$r_buff0_thd3~0_70 256) 0)) (.cse4 (= (mod v_~y$w_buff0_used~0_323 256) 0))) (let ((.cse3 (not .cse4)) (.cse9 (or .cse4 .cse12)) (.cse1 (not .cse5)) (.cse10 (not .cse14)) (.cse11 (or .cse14 .cse5)) (.cse8 (or .cse13 .cse12)) (.cse6 (not .cse13)) (.cse7 (not .cse12))) (and (let ((.cse2 (= (mod v_~y$r_buff0_thd3~0_69 256) 0)) (.cse0 (= (mod v_~y$w_buff1_used~0_233 256) 0))) (or (and (= 0 v_~y$r_buff1_thd3~0_55) (or (and (not .cse0) .cse1) (and (not .cse2) .cse3))) (and (or .cse4 .cse2) (or .cse0 .cse5) (= v_~y$r_buff1_thd3~0_56 v_~y$r_buff1_thd3~0_55)))) (or (and .cse6 (= v_~y$w_buff0_used~0_323 0) .cse7) (and (= v_~y$w_buff0_used~0_324 v_~y$w_buff0_used~0_323) .cse8)) (or (and (= v_~y$r_buff0_thd3~0_69 0) .cse7 .cse3) (and .cse9 (= v_~y$r_buff0_thd3~0_70 v_~y$r_buff0_thd3~0_69))) (or (and (= v_~y$w_buff1_used~0_233 0) (or (and .cse1 .cse10) (and .cse7 .cse3))) (and .cse11 .cse9 (= v_~y$w_buff1_used~0_234 v_~y$w_buff1_used~0_233))) (or (and (or (and (= |v_P2_#t~ite32_29| v_~y$w_buff1~0_60) .cse1 .cse10) (and (= v_~y~0_111 |v_P2_#t~ite32_29|) .cse11)) .cse8 (= v_~y~0_110 |v_P2_#t~ite32_29|)) (and (= v_~y~0_110 v_~y$w_buff0~0_61) .cse6 (= |v_P2_#t~ite32_29| |v_P2Thread1of1ForFork1_#t~ite32_1|) .cse7))))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_56, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_1|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_324, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_70, ~y$w_buff0~0=v_~y$w_buff0~0_61, ~y~0=v_~y~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_234} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_323, P2Thread1of1ForFork1_#t~ite36=|v_P2Thread1of1ForFork1_#t~ite36_1|, P2Thread1of1ForFork1_#t~ite35=|v_P2Thread1of1ForFork1_#t~ite35_1|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_55, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_1|, ~y$w_buff1~0=v_~y$w_buff1~0_60, P2Thread1of1ForFork1_#t~ite34=|v_P2Thread1of1ForFork1_#t~ite34_1|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_69, ~y$w_buff0~0=v_~y$w_buff0~0_61, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_1|, ~y~0=v_~y~0_110, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[|v_P2_#t~ite32_29|] AssignedVars[P2Thread1of1ForFork1_#t~ite36, P2Thread1of1ForFork1_#t~ite35, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, ~y$w_buff0_used~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite34, ~y$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite33, ~y~0, ~y$w_buff1_used~0][180], [P0Thread1of1ForFork2InUse, Black: 183#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 189#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 193#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 175#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 84#L4-1true, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 187#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 173#(= ~__unbuffered_p0_EAX~0 0), Black: 174#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 214#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 210#(and (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 207#true, Black: 138#(or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 218#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 216#(and (= ~__unbuffered_cnt~0 0) (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (<= 0 ~main$tmp_guard0~0)), Black: 157#(and (<= 1 ~main$tmp_guard1~0) (or (<= 1 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (<= (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 255) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), Black: 222#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), Black: 137#(= ~__unbuffered_p2_EAX~0 0), 29#L778true, Black: 151#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0)))), Black: 155#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p0_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p0_EBX~0 0)) (not (= 2 ~z~0)) (not (= 2 ~__unbuffered_p2_EAX~0))) (or (<= (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 255) 0) (<= 1 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|))), 71#L827true, 252#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (<= 0 |ULTIMATE.start_assume_abort_if_not_#in~cond#1|) (<= ~main$tmp_guard0~0 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)) (<= 0 ~main$tmp_guard0~0)), 171#true, 12#L807true, 135#true, P1Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 212#(and (<= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_~cond#1| 1)))]) [2022-09-20 20:33:42,385 INFO L383 tUnfolder$Statistics]: this new event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,385 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,385 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,385 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,385 INFO L386 tUnfolder$Statistics]: existing Event has 84 ancestors and is cut-off event [2022-09-20 20:33:42,414 INFO L130 PetriNetUnfolder]: 1973/4149 cut-off events. [2022-09-20 20:33:42,414 INFO L131 PetriNetUnfolder]: For 11351/12809 co-relation queries the response was YES. [2022-09-20 20:33:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13561 conditions, 4149 events. 1973/4149 cut-off events. For 11351/12809 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 33691 event pairs, 173 based on Foata normal form. 95/4003 useless extension candidates. Maximal degree in co-relation 13524. Up to 701 conditions per place. [2022-09-20 20:33:42,445 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 67 selfloop transitions, 32 changer transitions 30/219 dead transitions. [2022-09-20 20:33:42,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 219 transitions, 1342 flow [2022-09-20 20:33:42,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 20:33:42,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 20:33:42,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1369 transitions. [2022-09-20 20:33:42,448 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8775641025641026 [2022-09-20 20:33:42,448 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1369 transitions. [2022-09-20 20:33:42,448 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1369 transitions. [2022-09-20 20:33:42,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:42,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1369 transitions. [2022-09-20 20:33:42,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 105.3076923076923) internal successors, (1369), 13 states have internal predecessors, (1369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:42,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:42,517 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 120.0) internal successors, (1680), 14 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:42,517 INFO L175 Difference]: Start difference. First operand has 142 places, 126 transitions, 498 flow. Second operand 13 states and 1369 transitions. [2022-09-20 20:33:42,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 219 transitions, 1342 flow [2022-09-20 20:33:42,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 219 transitions, 1328 flow, removed 6 selfloop flow, removed 7 redundant places. [2022-09-20 20:33:42,538 INFO L231 Difference]: Finished difference. Result has 151 places, 146 transitions, 727 flow [2022-09-20 20:33:42,538 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=727, PETRI_PLACES=151, PETRI_TRANSITIONS=146} [2022-09-20 20:33:42,541 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 26 predicate places. [2022-09-20 20:33:42,541 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 146 transitions, 727 flow [2022-09-20 20:33:42,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 98.85714285714286) internal successors, (692), 7 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:42,541 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:42,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:42,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 20:33:42,543 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:42,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:42,543 INFO L85 PathProgramCache]: Analyzing trace with hash -300786303, now seen corresponding path program 1 times [2022-09-20 20:33:42,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:42,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653151217] [2022-09-20 20:33:42,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:42,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:42,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:42,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:42,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653151217] [2022-09-20 20:33:42,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653151217] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:42,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:42,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:33:42,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978873592] [2022-09-20 20:33:42,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:42,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:33:42,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:33:42,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:33:42,653 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-09-20 20:33:42,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 146 transitions, 727 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:42,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:42,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-09-20 20:33:42,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:43,110 INFO L130 PetriNetUnfolder]: 696/2758 cut-off events. [2022-09-20 20:33:43,111 INFO L131 PetriNetUnfolder]: For 6727/7190 co-relation queries the response was YES. [2022-09-20 20:33:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8509 conditions, 2758 events. 696/2758 cut-off events. For 6727/7190 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 28003 event pairs, 63 based on Foata normal form. 11/2628 useless extension candidates. Maximal degree in co-relation 8421. Up to 533 conditions per place. [2022-09-20 20:33:43,138 INFO L137 encePairwiseOnDemand]: 104/120 looper letters, 46 selfloop transitions, 26 changer transitions 22/204 dead transitions. [2022-09-20 20:33:43,138 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 204 transitions, 1199 flow [2022-09-20 20:33:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:33:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:33:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1063 transitions. [2022-09-20 20:33:43,140 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8053030303030303 [2022-09-20 20:33:43,140 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1063 transitions. [2022-09-20 20:33:43,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1063 transitions. [2022-09-20 20:33:43,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:43,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1063 transitions. [2022-09-20 20:33:43,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.63636363636364) internal successors, (1063), 11 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,144 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,144 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,144 INFO L175 Difference]: Start difference. First operand has 151 places, 146 transitions, 727 flow. Second operand 11 states and 1063 transitions. [2022-09-20 20:33:43,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 204 transitions, 1199 flow [2022-09-20 20:33:43,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 204 transitions, 1085 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-09-20 20:33:43,272 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 864 flow [2022-09-20 20:33:43,273 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=864, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2022-09-20 20:33:43,273 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 40 predicate places. [2022-09-20 20:33:43,273 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 864 flow [2022-09-20 20:33:43,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:43,274 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-20 20:33:43,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 20:33:43,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:43,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:43,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1894343971, now seen corresponding path program 2 times [2022-09-20 20:33:43,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:43,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461896172] [2022-09-20 20:33:43,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:43,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:43,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:43,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461896172] [2022-09-20 20:33:43,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461896172] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:43,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:43,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:33:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886703827] [2022-09-20 20:33:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:43,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:33:43,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:43,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:33:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:33:43,389 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 120 [2022-09-20 20:33:43,390 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 864 flow. Second operand has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,390 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:43,390 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 120 [2022-09-20 20:33:43,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:43,938 INFO L130 PetriNetUnfolder]: 896/3442 cut-off events. [2022-09-20 20:33:43,939 INFO L131 PetriNetUnfolder]: For 5906/5974 co-relation queries the response was YES. [2022-09-20 20:33:43,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9555 conditions, 3442 events. 896/3442 cut-off events. For 5906/5974 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 37159 event pairs, 46 based on Foata normal form. 11/3264 useless extension candidates. Maximal degree in co-relation 9451. Up to 299 conditions per place. [2022-09-20 20:33:43,975 INFO L137 encePairwiseOnDemand]: 104/120 looper letters, 57 selfloop transitions, 27 changer transitions 20/214 dead transitions. [2022-09-20 20:33:43,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 214 transitions, 1419 flow [2022-09-20 20:33:43,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:33:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:33:43,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 892 transitions. [2022-09-20 20:33:43,978 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.825925925925926 [2022-09-20 20:33:43,978 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 892 transitions. [2022-09-20 20:33:43,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 892 transitions. [2022-09-20 20:33:43,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:43,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 892 transitions. [2022-09-20 20:33:43,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.11111111111111) internal successors, (892), 9 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,981 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:43,981 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 864 flow. Second operand 9 states and 892 transitions. [2022-09-20 20:33:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 214 transitions, 1419 flow [2022-09-20 20:33:44,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 214 transitions, 1339 flow, removed 40 selfloop flow, removed 6 redundant places. [2022-09-20 20:33:44,036 INFO L231 Difference]: Finished difference. Result has 167 places, 164 transitions, 1000 flow [2022-09-20 20:33:44,036 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=840, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1000, PETRI_PLACES=167, PETRI_TRANSITIONS=164} [2022-09-20 20:33:44,037 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 42 predicate places. [2022-09-20 20:33:44,037 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 164 transitions, 1000 flow [2022-09-20 20:33:44,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 91.875) internal successors, (735), 8 states have internal predecessors, (735), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:44,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:44,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:44,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 20:33:44,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:44,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:44,038 INFO L85 PathProgramCache]: Analyzing trace with hash 367814021, now seen corresponding path program 3 times [2022-09-20 20:33:44,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:44,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342041318] [2022-09-20 20:33:44,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:44,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:44,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342041318] [2022-09-20 20:33:44,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342041318] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:44,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:44,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:33:44,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357956424] [2022-09-20 20:33:44,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:44,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:33:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:44,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:33:44,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:33:44,127 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 120 [2022-09-20 20:33:44,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 164 transitions, 1000 flow. Second operand has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:44,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:44,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 120 [2022-09-20 20:33:44,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:45,221 INFO L130 PetriNetUnfolder]: 3592/7639 cut-off events. [2022-09-20 20:33:45,221 INFO L131 PetriNetUnfolder]: For 32422/37783 co-relation queries the response was YES. [2022-09-20 20:33:45,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26197 conditions, 7639 events. 3592/7639 cut-off events. For 32422/37783 co-relation queries the response was YES. Maximal size of possible extension queue 669. Compared 71903 event pairs, 246 based on Foata normal form. 361/7648 useless extension candidates. Maximal degree in co-relation 26163. Up to 1033 conditions per place. [2022-09-20 20:33:45,270 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 44 selfloop transitions, 28 changer transitions 76/254 dead transitions. [2022-09-20 20:33:45,270 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 254 transitions, 2120 flow [2022-09-20 20:33:45,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 20:33:45,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 20:33:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1651 transitions. [2022-09-20 20:33:45,273 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8598958333333333 [2022-09-20 20:33:45,273 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1651 transitions. [2022-09-20 20:33:45,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1651 transitions. [2022-09-20 20:33:45,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:45,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1651 transitions. [2022-09-20 20:33:45,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 103.1875) internal successors, (1651), 16 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:45,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:45,279 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 120.0) internal successors, (2040), 17 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:45,279 INFO L175 Difference]: Start difference. First operand has 167 places, 164 transitions, 1000 flow. Second operand 16 states and 1651 transitions. [2022-09-20 20:33:45,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 254 transitions, 2120 flow [2022-09-20 20:33:45,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 254 transitions, 1961 flow, removed 63 selfloop flow, removed 7 redundant places. [2022-09-20 20:33:45,484 INFO L231 Difference]: Finished difference. Result has 178 places, 151 transitions, 900 flow [2022-09-20 20:33:45,484 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=900, PETRI_PLACES=178, PETRI_TRANSITIONS=151} [2022-09-20 20:33:45,485 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 53 predicate places. [2022-09-20 20:33:45,486 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 900 flow [2022-09-20 20:33:45,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.875) internal successors, (791), 8 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:45,486 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:45,486 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:45,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 20:33:45,487 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:45,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:45,487 INFO L85 PathProgramCache]: Analyzing trace with hash -501813876, now seen corresponding path program 1 times [2022-09-20 20:33:45,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:45,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74913855] [2022-09-20 20:33:45,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:45,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:45,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:45,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74913855] [2022-09-20 20:33:45,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74913855] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:45,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:45,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 20:33:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973812994] [2022-09-20 20:33:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:45,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 20:33:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 20:33:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 20:33:45,641 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 120 [2022-09-20 20:33:45,642 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 151 transitions, 900 flow. Second operand has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:45,642 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:45,642 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 120 [2022-09-20 20:33:45,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:46,046 INFO L130 PetriNetUnfolder]: 684/3583 cut-off events. [2022-09-20 20:33:46,047 INFO L131 PetriNetUnfolder]: For 8383/8607 co-relation queries the response was YES. [2022-09-20 20:33:46,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10248 conditions, 3583 events. 684/3583 cut-off events. For 8383/8607 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 44093 event pairs, 72 based on Foata normal form. 17/3387 useless extension candidates. Maximal degree in co-relation 10141. Up to 397 conditions per place. [2022-09-20 20:33:46,070 INFO L137 encePairwiseOnDemand]: 108/120 looper letters, 23 selfloop transitions, 9 changer transitions 37/172 dead transitions. [2022-09-20 20:33:46,070 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 172 transitions, 1184 flow [2022-09-20 20:33:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 20:33:46,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 20:33:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 681 transitions. [2022-09-20 20:33:46,084 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8107142857142857 [2022-09-20 20:33:46,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 681 transitions. [2022-09-20 20:33:46,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 681 transitions. [2022-09-20 20:33:46,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:46,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 681 transitions. [2022-09-20 20:33:46,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 97.28571428571429) internal successors, (681), 7 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,088 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 120.0) internal successors, (960), 8 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,088 INFO L175 Difference]: Start difference. First operand has 178 places, 151 transitions, 900 flow. Second operand 7 states and 681 transitions. [2022-09-20 20:33:46,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 172 transitions, 1184 flow [2022-09-20 20:33:46,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 172 transitions, 1065 flow, removed 27 selfloop flow, removed 19 redundant places. [2022-09-20 20:33:46,179 INFO L231 Difference]: Finished difference. Result has 166 places, 132 transitions, 577 flow [2022-09-20 20:33:46,179 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=799, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=577, PETRI_PLACES=166, PETRI_TRANSITIONS=132} [2022-09-20 20:33:46,180 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 41 predicate places. [2022-09-20 20:33:46,180 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 132 transitions, 577 flow [2022-09-20 20:33:46,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.42857142857143) internal successors, (661), 7 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:46,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:46,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 20:33:46,181 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:46,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1002254974, now seen corresponding path program 2 times [2022-09-20 20:33:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:46,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519020726] [2022-09-20 20:33:46,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:46,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:46,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:46,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519020726] [2022-09-20 20:33:46,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519020726] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:46,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:46,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 20:33:46,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938414014] [2022-09-20 20:33:46,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:46,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 20:33:46,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:46,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 20:33:46,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-09-20 20:33:46,320 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 120 [2022-09-20 20:33:46,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 132 transitions, 577 flow. Second operand has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:46,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 120 [2022-09-20 20:33:46,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:46,614 INFO L130 PetriNetUnfolder]: 249/1462 cut-off events. [2022-09-20 20:33:46,617 INFO L131 PetriNetUnfolder]: For 1103/1160 co-relation queries the response was YES. [2022-09-20 20:33:46,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 1462 events. 249/1462 cut-off events. For 1103/1160 co-relation queries the response was YES. Maximal size of possible extension queue 202. Compared 14831 event pairs, 5 based on Foata normal form. 3/1385 useless extension candidates. Maximal degree in co-relation 3095. Up to 171 conditions per place. [2022-09-20 20:33:46,625 INFO L137 encePairwiseOnDemand]: 112/120 looper letters, 20 selfloop transitions, 5 changer transitions 12/146 dead transitions. [2022-09-20 20:33:46,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 146 transitions, 701 flow [2022-09-20 20:33:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 20:33:46,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 20:33:46,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 898 transitions. [2022-09-20 20:33:46,629 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8314814814814815 [2022-09-20 20:33:46,629 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 898 transitions. [2022-09-20 20:33:46,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 898 transitions. [2022-09-20 20:33:46,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:46,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 898 transitions. [2022-09-20 20:33:46,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.77777777777777) internal successors, (898), 9 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,636 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 120.0) internal successors, (1200), 10 states have internal predecessors, (1200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,636 INFO L175 Difference]: Start difference. First operand has 166 places, 132 transitions, 577 flow. Second operand 9 states and 898 transitions. [2022-09-20 20:33:46,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 146 transitions, 701 flow [2022-09-20 20:33:46,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 146 transitions, 617 flow, removed 17 selfloop flow, removed 13 redundant places. [2022-09-20 20:33:46,646 INFO L231 Difference]: Finished difference. Result has 163 places, 132 transitions, 510 flow [2022-09-20 20:33:46,647 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=510, PETRI_PLACES=163, PETRI_TRANSITIONS=132} [2022-09-20 20:33:46,647 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 38 predicate places. [2022-09-20 20:33:46,647 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 132 transitions, 510 flow [2022-09-20 20:33:46,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.375) internal successors, (787), 8 states have internal predecessors, (787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:46,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:46,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 20:33:46,648 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:46,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:46,648 INFO L85 PathProgramCache]: Analyzing trace with hash 683155054, now seen corresponding path program 3 times [2022-09-20 20:33:46,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:46,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867386866] [2022-09-20 20:33:46,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:46,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 20:33:46,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 20:33:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 20:33:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867386866] [2022-09-20 20:33:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867386866] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 20:33:46,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 20:33:46,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 20:33:46,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3990655] [2022-09-20 20:33:46,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 20:33:46,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 20:33:46,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 20:33:46,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 20:33:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-09-20 20:33:46,848 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 120 [2022-09-20 20:33:46,849 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 132 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:46,849 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 20:33:46,849 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 120 [2022-09-20 20:33:46,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 20:33:47,056 INFO L130 PetriNetUnfolder]: 91/659 cut-off events. [2022-09-20 20:33:47,056 INFO L131 PetriNetUnfolder]: For 507/526 co-relation queries the response was YES. [2022-09-20 20:33:47,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1436 conditions, 659 events. 91/659 cut-off events. For 507/526 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4870 event pairs, 3 based on Foata normal form. 4/636 useless extension candidates. Maximal degree in co-relation 1407. Up to 75 conditions per place. [2022-09-20 20:33:47,060 INFO L137 encePairwiseOnDemand]: 110/120 looper letters, 22 selfloop transitions, 5 changer transitions 11/141 dead transitions. [2022-09-20 20:33:47,060 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 141 transitions, 626 flow [2022-09-20 20:33:47,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-09-20 20:33:47,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-09-20 20:33:47,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1045 transitions. [2022-09-20 20:33:47,062 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.7916666666666666 [2022-09-20 20:33:47,062 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1045 transitions. [2022-09-20 20:33:47,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1045 transitions. [2022-09-20 20:33:47,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 20:33:47,063 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1045 transitions. [2022-09-20 20:33:47,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 95.0) internal successors, (1045), 11 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:47,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:47,067 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 120.0) internal successors, (1440), 12 states have internal predecessors, (1440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:47,067 INFO L175 Difference]: Start difference. First operand has 163 places, 132 transitions, 510 flow. Second operand 11 states and 1045 transitions. [2022-09-20 20:33:47,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 141 transitions, 626 flow [2022-09-20 20:33:47,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 141 transitions, 581 flow, removed 19 selfloop flow, removed 9 redundant places. [2022-09-20 20:33:47,073 INFO L231 Difference]: Finished difference. Result has 163 places, 128 transitions, 478 flow [2022-09-20 20:33:47,073 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=120, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=478, PETRI_PLACES=163, PETRI_TRANSITIONS=128} [2022-09-20 20:33:47,074 INFO L287 CegarLoopForPetriNet]: 125 programPoint places, 38 predicate places. [2022-09-20 20:33:47,074 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 128 transitions, 478 flow [2022-09-20 20:33:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 93.91666666666667) internal successors, (1127), 12 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-09-20 20:33:47,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 20:33:47,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 20:33:47,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 20:33:47,075 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-09-20 20:33:47,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 20:33:47,075 INFO L85 PathProgramCache]: Analyzing trace with hash 812719114, now seen corresponding path program 4 times [2022-09-20 20:33:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 20:33:47,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209694409] [2022-09-20 20:33:47,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 20:33:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 20:33:47,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:33:47,108 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 20:33:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 20:33:47,168 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 20:33:47,168 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 20:33:47,168 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-09-20 20:33:47,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-09-20 20:33:47,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-09-20 20:33:47,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-09-20 20:33:47,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-09-20 20:33:47,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-09-20 20:33:47,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 20:33:47,170 INFO L444 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1, 1, 1, 1] [2022-09-20 20:33:47,174 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 20:33:47,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 20:33:47,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 08:33:47 BasicIcfg [2022-09-20 20:33:47,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 20:33:47,288 INFO L158 Benchmark]: Toolchain (without parser) took 10403.93ms. Allocated memory was 203.4MB in the beginning and 1.0GB in the end (delta: 798.0MB). Free memory was 148.2MB in the beginning and 621.0MB in the end (delta: -472.9MB). Peak memory consumption was 325.9MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,288 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 165.7MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 20:33:47,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.90ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 164.6MB in the end (delta: -16.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,289 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.28ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 162.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,289 INFO L158 Benchmark]: Boogie Preprocessor took 37.06ms. Allocated memory is still 203.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,289 INFO L158 Benchmark]: RCFGBuilder took 791.97ms. Allocated memory was 203.4MB in the beginning and 299.9MB in the end (delta: 96.5MB). Free memory was 160.1MB in the beginning and 258.7MB in the end (delta: -98.7MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,290 INFO L158 Benchmark]: TraceAbstraction took 9030.18ms. Allocated memory was 299.9MB in the beginning and 1.0GB in the end (delta: 701.5MB). Free memory was 258.2MB in the beginning and 621.0MB in the end (delta: -362.8MB). Peak memory consumption was 338.6MB. Max. memory is 8.0GB. [2022-09-20 20:33:47,291 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.13ms. Allocated memory is still 203.4MB. Free memory was 165.8MB in the beginning and 165.7MB in the end (delta: 150.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.90ms. Allocated memory is still 203.4MB. Free memory was 148.0MB in the beginning and 164.6MB in the end (delta: -16.6MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.28ms. Allocated memory is still 203.4MB. Free memory was 164.6MB in the beginning and 162.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.06ms. Allocated memory is still 203.4MB. Free memory was 162.2MB in the beginning and 160.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 791.97ms. Allocated memory was 203.4MB in the beginning and 299.9MB in the end (delta: 96.5MB). Free memory was 160.1MB in the beginning and 258.7MB in the end (delta: -98.7MB). Peak memory consumption was 61.6MB. Max. memory is 8.0GB. * TraceAbstraction took 9030.18ms. Allocated memory was 299.9MB in the beginning and 1.0GB in the end (delta: 701.5MB). Free memory was 258.2MB in the beginning and 621.0MB in the end (delta: -362.8MB). Peak memory consumption was 338.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L716] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0] [L718] 0 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L720] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L727] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L728] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L729] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L730] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L731] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L732] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L733] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L734] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L735] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L736] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L737] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L738] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L739] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L740] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L741] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L742] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] 0 pthread_t t636; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L845] FCALL, FORK 0 pthread_create(&t636, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t636, ((void *)0), P0, ((void *)0))=7, t636={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t637; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t637, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t637, ((void *)0), P1, ((void *)0))=8, t636={5:0}, t637={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t638; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t638, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t638, ((void *)0), P2, ((void *)0))=9, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 2 y$w_buff1 = y$w_buff0 [L785] 2 y$w_buff0 = 1 [L786] 2 y$w_buff1_used = y$w_buff0_used [L787] 2 y$w_buff0_used = (_Bool)1 [L788] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L788] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L789] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L790] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L791] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L792] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L793] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 2 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 3 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L756] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] 1 y$mem_tmp = y [L763] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L763] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L764] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L764] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L765] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L765] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L766] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L766] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L767] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L767] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L768] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L768] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L769] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L769] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 __unbuffered_p0_EBX = y [L771] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L771] 1 y = y$flush_delayed ? y$mem_tmp : y [L772] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L822] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L823] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L823] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L824] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L825] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L826] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L826] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L799] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L799] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L800] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L801] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L802] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L803] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L803] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L806] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L851] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L853] RET 0 assume_abort_if_not(main$tmp_guard0) [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L855] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L855] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L856] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L856] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L857] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L857] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L858] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L859] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L862] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t636={5:0}, t637={6:0}, t638={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L864] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 149 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 669 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 669 mSDsluCounter, 742 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1212 mSDsCounter, 134 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1404 IncrementalHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 134 mSolverCounterUnsat, 153 mSDtfsCounter, 1404 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1000occurred in iteration=7, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1025 NumberOfCodeBlocks, 1025 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 920 ConstructedInterpolants, 0 QuantifiedInterpolants, 4505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 20:33:47,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...