/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.3-dev-ac9dbd0-m
[2023-08-26 12:02:58,552 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2023-08-26 12:02:58,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf
[2023-08-26 12:02:58,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2023-08-26 12:02:58,624 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2023-08-26 12:02:58,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2023-08-26 12:02:58,650 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-08-26 12:02:58,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-08-26 12:02:58,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-08-26 12:02:58,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2023-08-26 12:02:58,654 INFO L153 SettingsManager]: * Use SBE=true
[2023-08-26 12:02:58,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-08-26 12:02:58,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2023-08-26 12:02:58,655 INFO L153 SettingsManager]: * sizeof long=4
[2023-08-26 12:02:58,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2023-08-26 12:02:58,655 INFO L153 SettingsManager]: * sizeof POINTER=4
[2023-08-26 12:02:58,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2023-08-26 12:02:58,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2023-08-26 12:02:58,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-08-26 12:02:58,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2023-08-26 12:02:58,656 INFO L153 SettingsManager]: * sizeof long double=12
[2023-08-26 12:02:58,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2023-08-26 12:02:58,657 INFO L153 SettingsManager]: * Use constant arrays=true
[2023-08-26 12:02:58,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-08-26 12:02:58,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2023-08-26 12:02:58,658 INFO L153 SettingsManager]: * To the following directory=./dump/
[2023-08-26 12:02:58,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2023-08-26 12:02:58,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-26 12:02:58,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-08-26 12:02:58,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2023-08-26 12:02:58,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-08-26 12:02:58,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2023-08-26 12:02:58,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-08-26 12:02:58,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2023-08-26 12:02:58,659 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2023-08-26 12:02:58,660 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
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
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true
[2023-08-26 12:02:58,953 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2023-08-26 12:02:58,967 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-08-26 12:02:58,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-08-26 12:02:58,969 INFO L270 PluginConnector]: Initializing CDTParser...
[2023-08-26 12:02:58,970 INFO L274 PluginConnector]: CDTParser initialized
[2023-08-26 12:02:58,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix027_tso.i
[2023-08-26 12:03:00,062 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2023-08-26 12:03:00,268 INFO L384 CDTParser]: Found 1 translation units.
[2023-08-26 12:03:00,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix027_tso.i
[2023-08-26 12:03:00,281 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42731db4/45cfd44260794ea082ca477d6406bca3/FLAGd36fd64ea
[2023-08-26 12:03:00,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42731db4/45cfd44260794ea082ca477d6406bca3
[2023-08-26 12:03:00,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-08-26 12:03:00,294 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2023-08-26 12:03:00,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-08-26 12:03:00,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-08-26 12:03:00,297 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2023-08-26 12:03:00,298 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,298 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@314e25de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00, skipping insertion in model container
[2023-08-26 12:03:00,298 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,323 INFO L176 MainTranslator]: Built tables and reachable declarations
[2023-08-26 12:03:00,602 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-26 12:03:00,614 INFO L201 MainTranslator]: Completed pre-run
[2023-08-26 12:03:00,648 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267]
[2023-08-26 12:03:00,650 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267]
[2023-08-26 12:03:00,673 INFO L209 PostProcessor]: Analyzing one entry point: main
[2023-08-26 12:03:00,706 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-08-26 12:03:00,706 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-08-26 12:03:00,711 INFO L206 MainTranslator]: Completed translation
[2023-08-26 12:03:00,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00 WrapperNode
[2023-08-26 12:03:00,711 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-08-26 12:03:00,712 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-08-26 12:03:00,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-08-26 12:03:00,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2023-08-26 12:03:00,718 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,744 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,779 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167
[2023-08-26 12:03:00,779 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-08-26 12:03:00,780 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-08-26 12:03:00,780 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2023-08-26 12:03:00,780 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2023-08-26 12:03:00,790 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,791 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,800 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,803 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,804 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,814 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-08-26 12:03:00,815 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-08-26 12:03:00,815 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2023-08-26 12:03:00,815 INFO L274 PluginConnector]: RCFGBuilder initialized
[2023-08-26 12:03:00,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (1/1) ...
[2023-08-26 12:03:00,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-08-26 12:03:00,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-08-26 12:03:00,845 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)
[2023-08-26 12:03:00,847 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
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2023-08-26 12:03:00,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2023-08-26 12:03:00,869 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2023-08-26 12:03:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2023-08-26 12:03:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2023-08-26 12:03:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure P3
[2023-08-26 12:03:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P3
[2023-08-26 12:03:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2023-08-26 12:03:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-08-26 12:03:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-08-26 12:03:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-08-26 12:03:00,871 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-08-26 12:03:00,976 INFO L236 CfgBuilder]: Building ICFG
[2023-08-26 12:03:00,977 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation
[2023-08-26 12:03:01,340 INFO L277 CfgBuilder]: Performing block encoding
[2023-08-26 12:03:01,470 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-08-26 12:03:01,471 INFO L302 CfgBuilder]: Removed 0 assume(true) statements.
[2023-08-26 12:03:01,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:03:01 BoogieIcfgContainer
[2023-08-26 12:03:01,473 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-08-26 12:03:01,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-08-26 12:03:01,475 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2023-08-26 12:03:01,478 INFO L274 PluginConnector]: TraceAbstraction initialized
[2023-08-26 12:03:01,478 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:03:00" (1/3) ...
[2023-08-26 12:03:01,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c53404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:03:01, skipping insertion in model container
[2023-08-26 12:03:01,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:03:00" (2/3) ...
[2023-08-26 12:03:01,479 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c53404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:03:01, skipping insertion in model container
[2023-08-26 12:03:01,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:03:01" (3/3) ...
[2023-08-26 12:03:01,481 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i
[2023-08-26 12:03:01,493 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-08-26 12:03:01,494 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations.
[2023-08-26 12:03:01,494 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-08-26 12:03:01,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-08-26 12:03:01,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 304 flow
[2023-08-26 12:03:01,634 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events.
[2023-08-26 12:03:01,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-26 12:03:01,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place.
[2023-08-26 12:03:01,640 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 142 transitions, 304 flow
[2023-08-26 12:03:01,646 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 138 transitions, 288 flow
[2023-08-26 12:03:01,650 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2023-08-26 12:03:01,663 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 138 transitions, 288 flow
[2023-08-26 12:03:01,666 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 138 transitions, 288 flow
[2023-08-26 12:03:01,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 138 transitions, 288 flow
[2023-08-26 12:03:01,713 INFO L124 PetriNetUnfolderBase]: 3/138 cut-off events.
[2023-08-26 12:03:01,713 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-26 12:03:01,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151 conditions, 138 events. 3/138 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 112 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place.
[2023-08-26 12:03:01,717 INFO L119 LiptonReduction]: Number of co-enabled transitions 3566
[2023-08-26 12:03:06,187 INFO L134 LiptonReduction]: Checked pairs total: 10701
[2023-08-26 12:03:06,187 INFO L136 LiptonReduction]: Total number of compositions: 148
[2023-08-26 12:03:06,197 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-08-26 12:03:06,206 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;@22a6f590, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2023-08-26 12:03:06,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations.
[2023-08-26 12:03:06,207 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-08-26 12:03:06,208 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events.
[2023-08-26 12:03:06,208 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-26 12:03:06,208 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:06,208 INFO L208 CegarLoopForPetriNet]: trace histogram [1]
[2023-08-26 12:03:06,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:06,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:06,216 INFO L85 PathProgramCache]: Analyzing trace with hash 634, now seen corresponding path program 1 times
[2023-08-26 12:03:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:06,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112586867]
[2023-08-26 12:03:06,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:06,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:06,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:06,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:06,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112586867]
[2023-08-26 12:03:06,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112586867] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:06,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:06,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2023-08-26 12:03:06,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664820455]
[2023-08-26 12:03:06,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:06,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-08-26 12:03:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:06,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-08-26 12:03:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-08-26 12:03:06,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 290
[2023-08-26 12:03:06,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:06,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:06,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 290
[2023-08-26 12:03:06,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:07,278 INFO L124 PetriNetUnfolderBase]: 4997/6949 cut-off events.
[2023-08-26 12:03:07,278 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES.
[2023-08-26 12:03:07,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 6949 events. 4997/6949 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 35914 event pairs, 4997 based on Foata normal form. 0/6087 useless extension candidates. Maximal degree in co-relation 13959. Up to 6807 conditions per place.
[2023-08-26 12:03:07,324 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 25 selfloop transitions, 0 changer transitions 0/30 dead transitions.
[2023-08-26 12:03:07,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 30 transitions, 122 flow
[2023-08-26 12:03:07,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2023-08-26 12:03:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2023-08-26 12:03:07,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 285 transitions.
[2023-08-26 12:03:07,338 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49137931034482757
[2023-08-26 12:03:07,338 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 285 transitions.
[2023-08-26 12:03:07,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 285 transitions.
[2023-08-26 12:03:07,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:07,342 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 285 transitions.
[2023-08-26 12:03:07,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 142.5) internal successors, (285), 2 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:07,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:07,420 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 290.0) internal successors, (870), 3 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:07,421 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 2 states and 285 transitions.
[2023-08-26 12:03:07,422 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 30 transitions, 122 flow
[2023-08-26 12:03:07,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 30 transitions, 118 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-08-26 12:03:07,428 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 68 flow
[2023-08-26 12:03:07,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=40, PETRI_TRANSITIONS=30}
[2023-08-26 12:03:07,432 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places.
[2023-08-26 12:03:07,432 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 68 flow
[2023-08-26 12:03:07,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:07,433 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:07,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1]
[2023-08-26 12:03:07,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-08-26 12:03:07,433 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:07,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:07,440 INFO L85 PathProgramCache]: Analyzing trace with hash 598695380, now seen corresponding path program 1 times
[2023-08-26 12:03:07,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:07,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219148935]
[2023-08-26 12:03:07,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:07,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:07,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:07,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:07,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219148935]
[2023-08-26 12:03:07,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219148935] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:07,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:07,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-26 12:03:07,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038649276]
[2023-08-26 12:03:07,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:07,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-26 12:03:07,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:07,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-26 12:03:07,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-26 12:03:07,673 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290
[2023-08-26 12:03:07,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:07,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:07,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290
[2023-08-26 12:03:07,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:08,190 INFO L124 PetriNetUnfolderBase]: 3927/5765 cut-off events.
[2023-08-26 12:03:08,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-08-26 12:03:08,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11314 conditions, 5765 events. 3927/5765 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 33395 event pairs, 717 based on Foata normal form. 0/5456 useless extension candidates. Maximal degree in co-relation 11311. Up to 4291 conditions per place.
[2023-08-26 12:03:08,212 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 37 selfloop transitions, 2 changer transitions 2/46 dead transitions.
[2023-08-26 12:03:08,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 186 flow
[2023-08-26 12:03:08,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-26 12:03:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-26 12:03:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 417 transitions.
[2023-08-26 12:03:08,214 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793103448275862
[2023-08-26 12:03:08,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 417 transitions.
[2023-08-26 12:03:08,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 417 transitions.
[2023-08-26 12:03:08,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:08,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 417 transitions.
[2023-08-26 12:03:08,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:08,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:08,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:08,217 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 68 flow. Second operand 3 states and 417 transitions.
[2023-08-26 12:03:08,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 186 flow
[2023-08-26 12:03:08,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-26 12:03:08,218 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 68 flow
[2023-08-26 12:03:08,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=41, PETRI_TRANSITIONS=28}
[2023-08-26 12:03:08,219 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places.
[2023-08-26 12:03:08,219 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 68 flow
[2023-08-26 12:03:08,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:08,220 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:08,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:08,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-08-26 12:03:08,220 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:08,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:08,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1146576873, now seen corresponding path program 1 times
[2023-08-26 12:03:08,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:08,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070755070]
[2023-08-26 12:03:08,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:08,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:08,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:08,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070755070]
[2023-08-26 12:03:08,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070755070] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:08,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:08,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-26 12:03:08,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052970553]
[2023-08-26 12:03:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:08,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-26 12:03:08,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:08,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-26 12:03:08,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-26 12:03:08,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 290
[2023-08-26 12:03:08,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:08,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:08,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 290
[2023-08-26 12:03:08,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:09,892 INFO L124 PetriNetUnfolderBase]: 11242/15116 cut-off events.
[2023-08-26 12:03:09,893 INFO L125 PetriNetUnfolderBase]: For 760/760 co-relation queries the response was YES.
[2023-08-26 12:03:09,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31356 conditions, 15116 events. 11242/15116 cut-off events. For 760/760 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 71003 event pairs, 1639 based on Foata normal form. 200/15316 useless extension candidates. Maximal degree in co-relation 31352. Up to 12817 conditions per place.
[2023-08-26 12:03:09,972 INFO L140 encePairwiseOnDemand]: 277/290 looper letters, 47 selfloop transitions, 14 changer transitions 0/61 dead transitions.
[2023-08-26 12:03:09,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 61 transitions, 264 flow
[2023-08-26 12:03:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-26 12:03:09,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-26 12:03:09,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions.
[2023-08-26 12:03:09,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43017241379310345
[2023-08-26 12:03:09,974 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 499 transitions.
[2023-08-26 12:03:09,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 499 transitions.
[2023-08-26 12:03:09,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:09,974 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 499 transitions.
[2023-08-26 12:03:09,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:09,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:09,977 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:09,977 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 4 states and 499 transitions.
[2023-08-26 12:03:09,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 61 transitions, 264 flow
[2023-08-26 12:03:09,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-08-26 12:03:09,980 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 155 flow
[2023-08-26 12:03:09,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=43, PETRI_TRANSITIONS=40}
[2023-08-26 12:03:09,980 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places.
[2023-08-26 12:03:09,981 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 155 flow
[2023-08-26 12:03:09,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:09,981 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:09,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:09,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-08-26 12:03:09,981 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:09,982 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:09,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1184142019, now seen corresponding path program 1 times
[2023-08-26 12:03:09,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:09,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612138091]
[2023-08-26 12:03:09,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:09,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:09,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:10,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:10,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:10,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612138091]
[2023-08-26 12:03:10,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612138091] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:10,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:10,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-08-26 12:03:10,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070813974]
[2023-08-26 12:03:10,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:10,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-08-26 12:03:10,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:10,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-08-26 12:03:10,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-08-26 12:03:10,113 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 290
[2023-08-26 12:03:10,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 155 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:10,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:10,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 290
[2023-08-26 12:03:10,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:10,832 INFO L124 PetriNetUnfolderBase]: 7043/9779 cut-off events.
[2023-08-26 12:03:10,833 INFO L125 PetriNetUnfolderBase]: For 3925/4222 co-relation queries the response was YES.
[2023-08-26 12:03:10,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26864 conditions, 9779 events. 7043/9779 cut-off events. For 3925/4222 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 50372 event pairs, 2293 based on Foata normal form. 284/9872 useless extension candidates. Maximal degree in co-relation 26858. Up to 5835 conditions per place.
[2023-08-26 12:03:10,873 INFO L140 encePairwiseOnDemand]: 287/290 looper letters, 46 selfloop transitions, 3 changer transitions 0/56 dead transitions.
[2023-08-26 12:03:10,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 310 flow
[2023-08-26 12:03:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-26 12:03:10,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-26 12:03:10,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions.
[2023-08-26 12:03:10,876 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4689655172413793
[2023-08-26 12:03:10,876 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions.
[2023-08-26 12:03:10,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions.
[2023-08-26 12:03:10,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:10,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions.
[2023-08-26 12:03:10,877 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:10,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:10,878 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:10,878 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 155 flow. Second operand 3 states and 408 transitions.
[2023-08-26 12:03:10,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 310 flow
[2023-08-26 12:03:10,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 310 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-08-26 12:03:10,884 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 166 flow
[2023-08-26 12:03:10,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=40}
[2023-08-26 12:03:10,885 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places.
[2023-08-26 12:03:10,885 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 166 flow
[2023-08-26 12:03:10,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:10,885 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:10,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:10,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-08-26 12:03:10,885 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:10,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1949305001, now seen corresponding path program 1 times
[2023-08-26 12:03:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:10,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075081354]
[2023-08-26 12:03:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:10,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:11,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075081354]
[2023-08-26 12:03:11,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075081354] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:11,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:11,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-08-26 12:03:11,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920804470]
[2023-08-26 12:03:11,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:11,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-26 12:03:11,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:11,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-26 12:03:11,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-26 12:03:11,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290
[2023-08-26 12:03:11,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:11,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:11,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290
[2023-08-26 12:03:11,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:12,144 INFO L124 PetriNetUnfolderBase]: 8048/11426 cut-off events.
[2023-08-26 12:03:12,144 INFO L125 PetriNetUnfolderBase]: For 6123/6209 co-relation queries the response was YES.
[2023-08-26 12:03:12,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32569 conditions, 11426 events. 8048/11426 cut-off events. For 6123/6209 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 63072 event pairs, 2041 based on Foata normal form. 125/10966 useless extension candidates. Maximal degree in co-relation 32561. Up to 9018 conditions per place.
[2023-08-26 12:03:12,225 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 51 selfloop transitions, 4 changer transitions 0/63 dead transitions.
[2023-08-26 12:03:12,226 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 356 flow
[2023-08-26 12:03:12,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2023-08-26 12:03:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-08-26 12:03:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 405 transitions.
[2023-08-26 12:03:12,227 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46551724137931033
[2023-08-26 12:03:12,227 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 405 transitions.
[2023-08-26 12:03:12,227 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 405 transitions.
[2023-08-26 12:03:12,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:12,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 405 transitions.
[2023-08-26 12:03:12,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:12,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:12,230 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:12,230 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 166 flow. Second operand 3 states and 405 transitions.
[2023-08-26 12:03:12,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 356 flow
[2023-08-26 12:03:12,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 63 transitions, 344 flow, removed 1 selfloop flow, removed 3 redundant places.
[2023-08-26 12:03:12,242 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 186 flow
[2023-08-26 12:03:12,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=46, PETRI_TRANSITIONS=43}
[2023-08-26 12:03:12,245 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places.
[2023-08-26 12:03:12,245 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 186 flow
[2023-08-26 12:03:12,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.0) internal successors, (496), 4 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:12,245 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:12,246 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:12,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-08-26 12:03:12,246 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:12,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:12,246 INFO L85 PathProgramCache]: Analyzing trace with hash 2024705306, now seen corresponding path program 1 times
[2023-08-26 12:03:12,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:12,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235284047]
[2023-08-26 12:03:12,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:12,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:12,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:12,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:12,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235284047]
[2023-08-26 12:03:12,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235284047] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:12,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:12,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-26 12:03:12,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420113032]
[2023-08-26 12:03:12,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:12,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:12,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:12,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:12,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:12,633 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290
[2023-08-26 12:03:12,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 186 flow. Second operand has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:12,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:12,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290
[2023-08-26 12:03:12,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:13,750 INFO L124 PetriNetUnfolderBase]: 8179/11633 cut-off events.
[2023-08-26 12:03:13,750 INFO L125 PetriNetUnfolderBase]: For 7019/7222 co-relation queries the response was YES.
[2023-08-26 12:03:13,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33868 conditions, 11633 events. 8179/11633 cut-off events. For 7019/7222 co-relation queries the response was YES. Maximal size of possible extension queue 472. Compared 63422 event pairs, 1734 based on Foata normal form. 201/11411 useless extension candidates. Maximal degree in co-relation 33860. Up to 7996 conditions per place.
[2023-08-26 12:03:13,820 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 66 selfloop transitions, 14 changer transitions 0/88 dead transitions.
[2023-08-26 12:03:13,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 88 transitions, 515 flow
[2023-08-26 12:03:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-26 12:03:13,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-26 12:03:13,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions.
[2023-08-26 12:03:13,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46379310344827585
[2023-08-26 12:03:13,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 538 transitions.
[2023-08-26 12:03:13,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 538 transitions.
[2023-08-26 12:03:13,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:13,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 538 transitions.
[2023-08-26 12:03:13,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:13,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:13,828 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:13,828 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 186 flow. Second operand 4 states and 538 transitions.
[2023-08-26 12:03:13,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 88 transitions, 515 flow
[2023-08-26 12:03:13,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 88 transitions, 511 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-26 12:03:13,832 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 273 flow
[2023-08-26 12:03:13,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=273, PETRI_PLACES=49, PETRI_TRANSITIONS=51}
[2023-08-26 12:03:13,832 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places.
[2023-08-26 12:03:13,833 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 273 flow
[2023-08-26 12:03:13,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:13,833 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:13,833 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:13,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-08-26 12:03:13,833 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:13,834 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:13,834 INFO L85 PathProgramCache]: Analyzing trace with hash -298859794, now seen corresponding path program 1 times
[2023-08-26 12:03:13,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:13,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010645366]
[2023-08-26 12:03:13,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:13,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:14,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:14,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010645366]
[2023-08-26 12:03:14,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010645366] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:14,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:14,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:14,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683745834]
[2023-08-26 12:03:14,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:14,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-26 12:03:14,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:14,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-26 12:03:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-26 12:03:14,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 290
[2023-08-26 12:03:14,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:14,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:14,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 290
[2023-08-26 12:03:14,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:15,548 INFO L124 PetriNetUnfolderBase]: 12014/16159 cut-off events.
[2023-08-26 12:03:15,548 INFO L125 PetriNetUnfolderBase]: For 12169/12169 co-relation queries the response was YES.
[2023-08-26 12:03:15,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51523 conditions, 16159 events. 12014/16159 cut-off events. For 12169/12169 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 80810 event pairs, 1143 based on Foata normal form. 120/16279 useless extension candidates. Maximal degree in co-relation 51514. Up to 12083 conditions per place.
[2023-08-26 12:03:15,643 INFO L140 encePairwiseOnDemand]: 276/290 looper letters, 95 selfloop transitions, 41 changer transitions 0/136 dead transitions.
[2023-08-26 12:03:15,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 136 transitions, 896 flow
[2023-08-26 12:03:15,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-26 12:03:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-26 12:03:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 639 transitions.
[2023-08-26 12:03:15,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4406896551724138
[2023-08-26 12:03:15,645 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 639 transitions.
[2023-08-26 12:03:15,646 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 639 transitions.
[2023-08-26 12:03:15,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:15,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 639 transitions.
[2023-08-26 12:03:15,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.8) internal successors, (639), 5 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:15,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:15,649 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:15,649 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 273 flow. Second operand 5 states and 639 transitions.
[2023-08-26 12:03:15,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 136 transitions, 896 flow
[2023-08-26 12:03:15,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 136 transitions, 882 flow, removed 3 selfloop flow, removed 1 redundant places.
[2023-08-26 12:03:15,766 INFO L231 Difference]: Finished difference. Result has 55 places, 81 transitions, 641 flow
[2023-08-26 12:03:15,766 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=641, PETRI_PLACES=55, PETRI_TRANSITIONS=81}
[2023-08-26 12:03:15,767 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places.
[2023-08-26 12:03:15,767 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 81 transitions, 641 flow
[2023-08-26 12:03:15,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.33333333333333) internal successors, (668), 6 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:15,767 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:15,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:15,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-08-26 12:03:15,767 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:15,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1514729851, now seen corresponding path program 1 times
[2023-08-26 12:03:15,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:15,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885280457]
[2023-08-26 12:03:15,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:15,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:16,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:16,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885280457]
[2023-08-26 12:03:16,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885280457] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:16,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:16,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-26 12:03:16,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271839709]
[2023-08-26 12:03:16,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:16,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:16,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:16,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:16,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:16,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290
[2023-08-26 12:03:16,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 81 transitions, 641 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:16,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:16,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290
[2023-08-26 12:03:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:17,186 INFO L124 PetriNetUnfolderBase]: 9674/13587 cut-off events.
[2023-08-26 12:03:17,187 INFO L125 PetriNetUnfolderBase]: For 32616/33155 co-relation queries the response was YES.
[2023-08-26 12:03:17,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57218 conditions, 13587 events. 9674/13587 cut-off events. For 32616/33155 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 73712 event pairs, 1701 based on Foata normal form. 335/13528 useless extension candidates. Maximal degree in co-relation 57207. Up to 9491 conditions per place.
[2023-08-26 12:03:17,262 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 89 selfloop transitions, 23 changer transitions 0/128 dead transitions.
[2023-08-26 12:03:17,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 128 transitions, 1156 flow
[2023-08-26 12:03:17,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-26 12:03:17,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-26 12:03:17,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions.
[2023-08-26 12:03:17,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4663793103448276
[2023-08-26 12:03:17,264 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions.
[2023-08-26 12:03:17,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions.
[2023-08-26 12:03:17,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:17,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions.
[2023-08-26 12:03:17,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:17,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:17,267 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:17,267 INFO L175 Difference]: Start difference. First operand has 55 places, 81 transitions, 641 flow. Second operand 4 states and 541 transitions.
[2023-08-26 12:03:17,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 128 transitions, 1156 flow
[2023-08-26 12:03:17,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 128 transitions, 1142 flow, removed 5 selfloop flow, removed 1 redundant places.
[2023-08-26 12:03:17,290 INFO L231 Difference]: Finished difference. Result has 59 places, 92 transitions, 834 flow
[2023-08-26 12:03:17,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=834, PETRI_PLACES=59, PETRI_TRANSITIONS=92}
[2023-08-26 12:03:17,291 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places.
[2023-08-26 12:03:17,291 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 92 transitions, 834 flow
[2023-08-26 12:03:17,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:17,292 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:17,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:17,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-08-26 12:03:17,292 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:17,292 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:17,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1515306761, now seen corresponding path program 1 times
[2023-08-26 12:03:17,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:17,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464462660]
[2023-08-26 12:03:17,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:17,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:17,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:17,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:17,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:17,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464462660]
[2023-08-26 12:03:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464462660] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:17,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:17,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-26 12:03:17,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682151112]
[2023-08-26 12:03:17,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:17,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:17,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:17,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:17,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:17,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 290
[2023-08-26 12:03:17,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 92 transitions, 834 flow. Second operand has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:17,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:17,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 290
[2023-08-26 12:03:17,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:18,886 INFO L124 PetriNetUnfolderBase]: 10301/14434 cut-off events.
[2023-08-26 12:03:18,886 INFO L125 PetriNetUnfolderBase]: For 40649/41311 co-relation queries the response was YES.
[2023-08-26 12:03:18,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64399 conditions, 14434 events. 10301/14434 cut-off events. For 40649/41311 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 78573 event pairs, 1736 based on Foata normal form. 441/14481 useless extension candidates. Maximal degree in co-relation 64385. Up to 9879 conditions per place.
[2023-08-26 12:03:18,979 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 100 selfloop transitions, 33 changer transitions 0/149 dead transitions.
[2023-08-26 12:03:18,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 149 transitions, 1426 flow
[2023-08-26 12:03:18,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-26 12:03:18,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-26 12:03:18,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions.
[2023-08-26 12:03:18,981 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46620689655172415
[2023-08-26 12:03:18,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions.
[2023-08-26 12:03:18,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions.
[2023-08-26 12:03:18,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:18,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions.
[2023-08-26 12:03:18,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:18,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:18,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:18,985 INFO L175 Difference]: Start difference. First operand has 59 places, 92 transitions, 834 flow. Second operand 5 states and 676 transitions.
[2023-08-26 12:03:18,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 149 transitions, 1426 flow
[2023-08-26 12:03:19,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 149 transitions, 1416 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-08-26 12:03:19,019 INFO L231 Difference]: Finished difference. Result has 63 places, 102 transitions, 1020 flow
[2023-08-26 12:03:19,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1020, PETRI_PLACES=63, PETRI_TRANSITIONS=102}
[2023-08-26 12:03:19,020 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places.
[2023-08-26 12:03:19,020 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 102 transitions, 1020 flow
[2023-08-26 12:03:19,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.0) internal successors, (620), 5 states have internal predecessors, (620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:19,020 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:19,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:19,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-08-26 12:03:19,021 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:19,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1657015511, now seen corresponding path program 2 times
[2023-08-26 12:03:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888664761]
[2023-08-26 12:03:19,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:19,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:19,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888664761]
[2023-08-26 12:03:19,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888664761] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:19,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:19,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:19,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265268266]
[2023-08-26 12:03:19,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:19,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-26 12:03:19,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:19,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-26 12:03:19,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-26 12:03:19,468 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 290
[2023-08-26 12:03:19,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 102 transitions, 1020 flow. Second operand has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:19,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:19,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 290
[2023-08-26 12:03:19,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:20,988 INFO L124 PetriNetUnfolderBase]: 13137/17639 cut-off events.
[2023-08-26 12:03:20,988 INFO L125 PetriNetUnfolderBase]: For 48134/48134 co-relation queries the response was YES.
[2023-08-26 12:03:21,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80876 conditions, 17639 events. 13137/17639 cut-off events. For 48134/48134 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 86512 event pairs, 2022 based on Foata normal form. 52/17691 useless extension candidates. Maximal degree in co-relation 80861. Up to 14190 conditions per place.
[2023-08-26 12:03:21,082 INFO L140 encePairwiseOnDemand]: 276/290 looper letters, 148 selfloop transitions, 92 changer transitions 0/240 dead transitions.
[2023-08-26 12:03:21,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 240 transitions, 2428 flow
[2023-08-26 12:03:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-26 12:03:21,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-26 12:03:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 889 transitions.
[2023-08-26 12:03:21,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4379310344827586
[2023-08-26 12:03:21,084 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 889 transitions.
[2023-08-26 12:03:21,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 889 transitions.
[2023-08-26 12:03:21,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:21,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 889 transitions.
[2023-08-26 12:03:21,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.0) internal successors, (889), 7 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:21,088 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:21,088 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:21,088 INFO L175 Difference]: Start difference. First operand has 63 places, 102 transitions, 1020 flow. Second operand 7 states and 889 transitions.
[2023-08-26 12:03:21,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 240 transitions, 2428 flow
[2023-08-26 12:03:21,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 240 transitions, 2351 flow, removed 10 selfloop flow, removed 3 redundant places.
[2023-08-26 12:03:21,144 INFO L231 Difference]: Finished difference. Result has 70 places, 158 transitions, 1877 flow
[2023-08-26 12:03:21,144 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=947, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1877, PETRI_PLACES=70, PETRI_TRANSITIONS=158}
[2023-08-26 12:03:21,144 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places.
[2023-08-26 12:03:21,144 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 158 transitions, 1877 flow
[2023-08-26 12:03:21,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:21,145 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:21,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:21,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-08-26 12:03:21,145 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:21,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1199491025, now seen corresponding path program 3 times
[2023-08-26 12:03:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:21,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744923746]
[2023-08-26 12:03:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:21,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:21,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744923746]
[2023-08-26 12:03:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744923746] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:21,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:21,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690093637]
[2023-08-26 12:03:21,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:21,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-26 12:03:21,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:21,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-26 12:03:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-08-26 12:03:21,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 290
[2023-08-26 12:03:21,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 158 transitions, 1877 flow. Second operand has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 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)
[2023-08-26 12:03:21,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:21,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 290
[2023-08-26 12:03:21,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:23,021 INFO L124 PetriNetUnfolderBase]: 12375/17211 cut-off events.
[2023-08-26 12:03:23,021 INFO L125 PetriNetUnfolderBase]: For 97417/97965 co-relation queries the response was YES.
[2023-08-26 12:03:23,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96003 conditions, 17211 events. 12375/17211 cut-off events. For 97417/97965 co-relation queries the response was YES. Maximal size of possible extension queue 680. Compared 94394 event pairs, 2013 based on Foata normal form. 345/17095 useless extension candidates. Maximal degree in co-relation 95984. Up to 10651 conditions per place.
[2023-08-26 12:03:23,156 INFO L140 encePairwiseOnDemand]: 282/290 looper letters, 120 selfloop transitions, 81 changer transitions 0/233 dead transitions.
[2023-08-26 12:03:23,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 233 transitions, 2843 flow
[2023-08-26 12:03:23,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-26 12:03:23,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-26 12:03:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 809 transitions.
[2023-08-26 12:03:23,158 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4649425287356322
[2023-08-26 12:03:23,158 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 809 transitions.
[2023-08-26 12:03:23,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 809 transitions.
[2023-08-26 12:03:23,159 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:23,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 809 transitions.
[2023-08-26 12:03:23,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.83333333333334) internal successors, (809), 6 states have internal predecessors, (809), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:23,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:23,162 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:23,162 INFO L175 Difference]: Start difference. First operand has 70 places, 158 transitions, 1877 flow. Second operand 6 states and 809 transitions.
[2023-08-26 12:03:23,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 233 transitions, 2843 flow
[2023-08-26 12:03:23,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 233 transitions, 2726 flow, removed 36 selfloop flow, removed 2 redundant places.
[2023-08-26 12:03:23,311 INFO L231 Difference]: Finished difference. Result has 75 places, 173 transitions, 2234 flow
[2023-08-26 12:03:23,311 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1766, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2234, PETRI_PLACES=75, PETRI_TRANSITIONS=173}
[2023-08-26 12:03:23,312 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 24 predicate places.
[2023-08-26 12:03:23,312 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 173 transitions, 2234 flow
[2023-08-26 12:03:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.5) internal successors, (735), 6 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)
[2023-08-26 12:03:23,312 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:23,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:23,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-08-26 12:03:23,313 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:23,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:23,313 INFO L85 PathProgramCache]: Analyzing trace with hash 557433589, now seen corresponding path program 1 times
[2023-08-26 12:03:23,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:23,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015264790]
[2023-08-26 12:03:23,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:23,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:23,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:23,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:23,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015264790]
[2023-08-26 12:03:23,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015264790] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:23,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:23,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-26 12:03:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865229358]
[2023-08-26 12:03:23,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:23,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-26 12:03:23,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:23,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-26 12:03:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2023-08-26 12:03:23,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290
[2023-08-26 12:03:23,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 173 transitions, 2234 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:23,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:23,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290
[2023-08-26 12:03:23,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:24,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][162], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,075 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,075 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,075 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,075 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,075 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][167], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 96#L791true, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,076 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,076 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,076 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][162], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 229#true, 107#L781true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,077 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 229#true, 107#L781true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,077 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][285], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 107#L781true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,078 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,078 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,078 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,078 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:24,256 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][162], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 229#true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,257 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,257 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,257 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,257 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,257 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][167], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 145#L827true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, 96#L791true, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 216#true])
[2023-08-26 12:03:24,260 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 145#L827true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,260 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,260 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][285], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 229#true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), 216#true])
[2023-08-26 12:03:24,261 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,261 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,261 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,261 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:24,876 INFO L124 PetriNetUnfolderBase]: 10331/14367 cut-off events.
[2023-08-26 12:03:24,877 INFO L125 PetriNetUnfolderBase]: For 180108/187880 co-relation queries the response was YES.
[2023-08-26 12:03:24,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91471 conditions, 14367 events. 10331/14367 cut-off events. For 180108/187880 co-relation queries the response was YES. Maximal size of possible extension queue 782. Compared 80764 event pairs, 1568 based on Foata normal form. 2878/16422 useless extension candidates. Maximal degree in co-relation 91449. Up to 8945 conditions per place.
[2023-08-26 12:03:24,967 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 354 selfloop transitions, 10 changer transitions 2/403 dead transitions.
[2023-08-26 12:03:24,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 403 transitions, 6151 flow
[2023-08-26 12:03:24,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-26 12:03:24,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-26 12:03:24,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions.
[2023-08-26 12:03:24,969 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45379310344827584
[2023-08-26 12:03:24,969 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions.
[2023-08-26 12:03:24,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions.
[2023-08-26 12:03:24,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:24,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions.
[2023-08-26 12:03:24,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:24,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:24,972 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:24,972 INFO L175 Difference]: Start difference. First operand has 75 places, 173 transitions, 2234 flow. Second operand 5 states and 658 transitions.
[2023-08-26 12:03:24,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 403 transitions, 6151 flow
[2023-08-26 12:03:25,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 403 transitions, 5770 flow, removed 60 selfloop flow, removed 3 redundant places.
[2023-08-26 12:03:25,070 INFO L231 Difference]: Finished difference. Result has 79 places, 176 transitions, 2143 flow
[2023-08-26 12:03:25,071 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=2020, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2143, PETRI_PLACES=79, PETRI_TRANSITIONS=176}
[2023-08-26 12:03:25,071 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 28 predicate places.
[2023-08-26 12:03:25,071 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 176 transitions, 2143 flow
[2023-08-26 12:03:25,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:25,071 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:25,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:25,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-08-26 12:03:25,072 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:25,072 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash -22940372, now seen corresponding path program 1 times
[2023-08-26 12:03:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778181514]
[2023-08-26 12:03:25,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:25,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:25,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:25,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778181514]
[2023-08-26 12:03:25,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778181514] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:25,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:25,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591928769]
[2023-08-26 12:03:25,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:25,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:25,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:25,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:25,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:25,179 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290
[2023-08-26 12:03:25,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 176 transitions, 2143 flow. Second operand has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:25,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:25,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290
[2023-08-26 12:03:25,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:25,815 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 187#true, 155#true, 119#L811true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), 216#true, Black: 246#(= ~__unbuffered_cnt~0 0)])
[2023-08-26 12:03:25,815 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,815 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][164], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, 96#L791true, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,816 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,816 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,816 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 107#L781true, 187#true, 155#true, 119#L811true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,817 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][290], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 107#L781true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,817 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,817 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 107#L781true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,818 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,818 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,818 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,818 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:25,969 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 187#true, 155#true, 119#L811true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), 216#true, Black: 246#(= ~__unbuffered_cnt~0 0)])
[2023-08-26 12:03:25,969 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,969 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,969 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,969 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][164], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, 96#L791true, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,970 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][290], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,970 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), 249#(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| 1))), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:25,970 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:25,970 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:26,494 INFO L124 PetriNetUnfolderBase]: 8254/11653 cut-off events.
[2023-08-26 12:03:26,494 INFO L125 PetriNetUnfolderBase]: For 152581/159895 co-relation queries the response was YES.
[2023-08-26 12:03:26,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74353 conditions, 11653 events. 8254/11653 cut-off events. For 152581/159895 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 65919 event pairs, 652 based on Foata normal form. 2366/13394 useless extension candidates. Maximal degree in co-relation 74328. Up to 6940 conditions per place.
[2023-08-26 12:03:26,565 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 396 selfloop transitions, 19 changer transitions 10/462 dead transitions.
[2023-08-26 12:03:26,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 462 transitions, 6684 flow
[2023-08-26 12:03:26,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2023-08-26 12:03:26,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-08-26 12:03:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 923 transitions.
[2023-08-26 12:03:26,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.454679802955665
[2023-08-26 12:03:26,568 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 923 transitions.
[2023-08-26 12:03:26,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 923 transitions.
[2023-08-26 12:03:26,568 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:26,568 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 923 transitions.
[2023-08-26 12:03:26,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.85714285714286) internal successors, (923), 7 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:26,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:26,572 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:26,572 INFO L175 Difference]: Start difference. First operand has 79 places, 176 transitions, 2143 flow. Second operand 7 states and 923 transitions.
[2023-08-26 12:03:26,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 462 transitions, 6684 flow
[2023-08-26 12:03:26,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 462 transitions, 6581 flow, removed 49 selfloop flow, removed 1 redundant places.
[2023-08-26 12:03:26,667 INFO L231 Difference]: Finished difference. Result has 87 places, 169 transitions, 2039 flow
[2023-08-26 12:03:26,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2039, PETRI_PLACES=87, PETRI_TRANSITIONS=169}
[2023-08-26 12:03:26,668 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places.
[2023-08-26 12:03:26,668 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 169 transitions, 2039 flow
[2023-08-26 12:03:26,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.0) internal successors, (605), 5 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:26,668 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:26,668 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]
[2023-08-26 12:03:26,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-08-26 12:03:26,669 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:26,669 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:26,669 INFO L85 PathProgramCache]: Analyzing trace with hash -287382479, now seen corresponding path program 1 times
[2023-08-26 12:03:26,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:26,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170462565]
[2023-08-26 12:03:26,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:26,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:26,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:26,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:26,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170462565]
[2023-08-26 12:03:26,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170462565] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:26,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:26,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-08-26 12:03:26,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416250903]
[2023-08-26 12:03:26,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:26,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-08-26 12:03:26,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-08-26 12:03:26,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30
[2023-08-26 12:03:26,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290
[2023-08-26 12:03:26,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 169 transitions, 2039 flow. Second operand has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:26,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:26,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290
[2023-08-26 12:03:26,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:27,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,692 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,692 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,692 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][164], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, 96#L791true, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), 216#true, Black: 246#(= ~__unbuffered_cnt~0 0)])
[2023-08-26 12:03:27,692 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 98#L824true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,693 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,693 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 107#L781true, Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,694 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][290], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 107#L781true, Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,694 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,694 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 107#L781true, Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,695 INFO L294 olderBase$Statistics]: this new event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,695 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,695 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,695 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event
[2023-08-26 12:03:27,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([438] L804-->L811: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd3~0_18 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_133 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd3~0_22 256) 0)))) (let ((.cse1 (and .cse4 .cse5)) (.cse0 (and (not (= 0 (mod v_~x$w_buff0_used~0_134 256))) .cse5)) (.cse2 (and (not (= (mod v_~x$w_buff1_used~0_115 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~x$w_buff0_used~0_134) v_~x$w_buff0_used~0_133) (= (ite .cse1 0 v_~x$r_buff0_thd3~0_22) v_~x$r_buff0_thd3~0_21) (= v_~x$w_buff1_used~0_114 (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_115)) (= v_~x~0_75 (ite .cse0 v_~x$w_buff0~0_46 (ite .cse2 v_~x$w_buff1~0_43 v_~x~0_76))) (= v_~x$r_buff1_thd3~0_17 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_114 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd3~0_21 256) 0)) .cse4)) 0 v_~x$r_buff1_thd3~0_18))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_18, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_115, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_22, ~x~0=v_~x~0_76, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_134} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_46, ~x$w_buff1~0=v_~x$w_buff1~0_43, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_17, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_114, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_21, ~x~0=v_~x~0_75, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_133} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$w_buff1_used~0, ~x$r_buff0_thd3~0, ~x~0, ~x$w_buff0_used~0][163], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 119#L811true, 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,884 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([431] L784-->L791: Formula: (let ((.cse0 (not (= 0 (mod v_~x$w_buff0_used~0_95 256)))) (.cse1 (not (= (mod v_~x$r_buff1_thd2~0_20 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd2~0_23 256) 0)))) (let ((.cse2 (and (not (= (mod v_~x$w_buff0_used~0_96 256) 0)) .cse5)) (.cse3 (and .cse1 (not (= (mod v_~x$w_buff1_used~0_81 256) 0)))) (.cse4 (and .cse0 .cse5))) (and (= v_~x$r_buff1_thd2~0_19 (ite (or (and (not (= (mod v_~x$r_buff0_thd2~0_22 256) 0)) .cse0) (and .cse1 (not (= (mod v_~x$w_buff1_used~0_80 256) 0)))) 0 v_~x$r_buff1_thd2~0_20)) (= (ite .cse2 0 v_~x$w_buff0_used~0_96) v_~x$w_buff0_used~0_95) (= v_~x~0_49 (ite .cse2 v_~x$w_buff0~0_32 (ite .cse3 v_~x$w_buff1~0_29 v_~x~0_50))) (= v_~x$r_buff0_thd2~0_22 (ite .cse4 0 v_~x$r_buff0_thd2~0_23)) (= v_~x$w_buff1_used~0_80 (ite (or .cse3 .cse4) 0 v_~x$w_buff1_used~0_81))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_20, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_81, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_23, ~x~0=v_~x~0_50, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_96} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_32, ~x$w_buff1~0=v_~x$w_buff1~0_29, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_19, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_80, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_22, ~x~0=v_~x~0_49, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_95} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$w_buff1_used~0, ~x$r_buff0_thd2~0, ~x~0, ~x$w_buff0_used~0][164], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, P3Thread1of1ForFork1InUse, P2Thread1of1ForFork3InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), 96#L791true, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), 216#true, Black: 246#(= ~__unbuffered_cnt~0 0)])
[2023-08-26 12:03:27,885 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([446] L827-->L834: Formula: (let ((.cse3 (not (= (mod v_~x$r_buff1_thd4~0_20 256) 0))) (.cse4 (not (= (mod v_~x$w_buff0_used~0_149 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd4~0_22 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_150 256) 0)) .cse5)) (.cse2 (and .cse4 .cse5)) (.cse1 (and .cse3 (not (= 0 (mod v_~x$w_buff1_used~0_129 256)))))) (and (= v_~x~0_87 (ite .cse0 v_~x$w_buff0~0_56 (ite .cse1 v_~x$w_buff1~0_51 v_~x~0_88))) (= v_~x$w_buff0_used~0_149 (ite .cse0 0 v_~x$w_buff0_used~0_150)) (= (ite .cse2 0 v_~x$r_buff0_thd4~0_22) v_~x$r_buff0_thd4~0_21) (= (ite (or .cse2 .cse1) 0 v_~x$w_buff1_used~0_129) v_~x$w_buff1_used~0_128) (= v_~x$r_buff1_thd4~0_19 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_128 256) 0)) .cse3) (and .cse4 (not (= (mod v_~x$r_buff0_thd4~0_21 256) 0)))) 0 v_~x$r_buff1_thd4~0_20))))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_129, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_22, ~x~0=v_~x~0_88, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_20, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_150} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_56, ~x$w_buff1~0=v_~x$w_buff1~0_51, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_128, ~x$r_buff0_thd4~0=v_~x$r_buff0_thd4~0_21, ~x~0=v_~x~0_87, ~x$r_buff1_thd4~0=v_~x$r_buff1_thd4~0_19, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_149} AuxVars[] AssignedVars[~x$w_buff1_used~0, ~x$r_buff0_thd4~0, ~x~0, ~x$r_buff1_thd4~0, ~x$w_buff0_used~0][290], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, 103#L834true, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 37#L754true, Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,885 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,885 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,886 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([423] L754-->L761: Formula: (let ((.cse4 (not (= (mod v_~x$w_buff0_used~0_153 256) 0))) (.cse3 (not (= (mod v_~x$r_buff1_thd1~0_22 256) 0))) (.cse5 (not (= (mod v_~x$r_buff0_thd1~0_26 256) 0)))) (let ((.cse0 (and (not (= (mod v_~x$w_buff0_used~0_154 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~x$w_buff1_used~0_133 256) 0)))) (.cse2 (and .cse4 .cse5))) (and (= v_~x~0_91 (ite .cse0 v_~x$w_buff0~0_58 (ite .cse1 v_~x$w_buff1~0_53 v_~x~0_92))) (= v_~x$r_buff0_thd1~0_25 (ite .cse2 0 v_~x$r_buff0_thd1~0_26)) (= v_~x$w_buff0_used~0_153 (ite .cse0 0 v_~x$w_buff0_used~0_154)) (= v_~x$r_buff1_thd1~0_21 (ite (or (and (not (= (mod v_~x$w_buff1_used~0_132 256) 0)) .cse3) (and (not (= (mod v_~x$r_buff0_thd1~0_25 256) 0)) .cse4)) 0 v_~x$r_buff1_thd1~0_22)) (= (ite (or .cse1 .cse2) 0 v_~x$w_buff1_used~0_133) v_~x$w_buff1_used~0_132)))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_26, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_133, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_22, ~x~0=v_~x~0_92, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_154} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_58, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_25, ~x$w_buff1~0=v_~x$w_buff1~0_53, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_132, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~x~0=v_~x~0_91, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_153} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd1~0, ~x~0, ~x$w_buff0_used~0][168], [Black: 192#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 191#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (= ~x~0 ~x$w_buff1~0)), 145#L827true, Black: 262#(and (<= ~__unbuffered_cnt~0 1) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 257#(<= ~__unbuffered_cnt~0 1), 274#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 258#(= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0), 187#true, 155#true, Black: 205#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (or (= ~x~0 0) (= ~x~0 1)) (= ~x$r_buff1_thd1~0 0)), 260#(and (= ~__unbuffered_cnt~0 0) (= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)), Black: 202#(and (= 0 ~x$w_buff1~0) (= 0 ~x$w_buff0~0) (= ~x~0 1) (= ~x$r_buff1_thd1~0 0)), P0Thread1of1ForFork2InUse, 124#L784true, P3Thread1of1ForFork1InUse, Black: 213#(and (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), P2Thread1of1ForFork3InUse, P1Thread1of1ForFork0InUse, Black: 220#(and (= ~x$w_buff1_used~0 0) (= 2 ~x$w_buff0~0) (not (= 2 ~x~0)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 221#(and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (= 0 ~x$r_buff0_thd0~0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0)))), Black: 218#(and (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), Black: 223#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~x$w_buff0_used~0 0) (= 0 ~x$r_buff0_thd0~0)), 162#true, Black: 165#(and (or (and (not (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0)) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))))) (and (or (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (not (= 2 ~z~0)) (not (= 2 ~x$w_buff1~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (and (not (= ~x$w_buff1_used~0 (* (div ~x$w_buff1_used~0 256) 256))) (not (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256)))) (not (= (* 256 (div ~x$r_buff1_thd0~0 256)) ~x$r_buff1_thd0~0))) (not (= 2 ~z~0))))) (or (not (= 2 ~x$w_buff0~0)) (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~x$w_buff0_used~0 (* 256 (div ~x$w_buff0_used~0 256))) (= (* 256 (div ~x$r_buff0_thd0~0 256)) ~x$r_buff0_thd0~0) (not (= 2 ~z~0)))), 117#L761true, Black: 171#(= ~__unbuffered_p3_EAX~0 0), Black: 236#(and (not (= 2 ~x$w_buff0~0)) (or (= ~x~0 ~x$w_buff0~0) (= ~x~0 1)) (= ~x$r_buff1_thd0~0 0) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 234#(and (not (= 2 ~x~0)) (= 0 ~x$r_buff0_thd0~0) (not (= 2 ~x$w_buff1~0))), Black: 176#(and (= 0 ~x$w_buff1~0) (= ~x~0 0) (= ~x$w_buff1_used~0 0) (= 0 ~x$w_buff0~0)), 143#L804true, 78#L2true, 249#(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| 1))), Black: 183#(and (= 0 ~x$w_buff1~0) (not (= 2 ~x$w_buff0~0)) (= ~x$r_buff1_thd0~0 0) (= ~x~0 1) (= 0 ~x$r_buff0_thd0~0)), Black: 247#(and (<= |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0) (< 0 (+ |ULTIMATE.start_assume_abort_if_not_#in~cond#1| 1))), Black: 246#(= ~__unbuffered_cnt~0 0), 216#true])
[2023-08-26 12:03:27,886 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,886 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,886 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:27,886 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event
[2023-08-26 12:03:28,283 INFO L124 PetriNetUnfolderBase]: 7804/10976 cut-off events.
[2023-08-26 12:03:28,283 INFO L125 PetriNetUnfolderBase]: For 130603/136900 co-relation queries the response was YES.
[2023-08-26 12:03:28,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71096 conditions, 10976 events. 7804/10976 cut-off events. For 130603/136900 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 61762 event pairs, 531 based on Foata normal form. 1674/12045 useless extension candidates. Maximal degree in co-relation 71068. Up to 6446 conditions per place.
[2023-08-26 12:03:28,376 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 398 selfloop transitions, 28 changer transitions 21/484 dead transitions.
[2023-08-26 12:03:28,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 484 transitions, 6921 flow
[2023-08-26 12:03:28,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2023-08-26 12:03:28,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-08-26 12:03:28,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1186 transitions.
[2023-08-26 12:03:28,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45440613026819926
[2023-08-26 12:03:28,379 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1186 transitions.
[2023-08-26 12:03:28,379 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1186 transitions.
[2023-08-26 12:03:28,379 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:28,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1186 transitions.
[2023-08-26 12:03:28,381 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.77777777777777) internal successors, (1186), 9 states have internal predecessors, (1186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:28,383 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:28,384 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 290.0) internal successors, (2900), 10 states have internal predecessors, (2900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:28,384 INFO L175 Difference]: Start difference. First operand has 87 places, 169 transitions, 2039 flow. Second operand 9 states and 1186 transitions.
[2023-08-26 12:03:28,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 484 transitions, 6921 flow
[2023-08-26 12:03:28,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 484 transitions, 6659 flow, removed 49 selfloop flow, removed 6 redundant places.
[2023-08-26 12:03:28,793 INFO L231 Difference]: Finished difference. Result has 92 places, 169 transitions, 1977 flow
[2023-08-26 12:03:28,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1795, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1977, PETRI_PLACES=92, PETRI_TRANSITIONS=169}
[2023-08-26 12:03:28,794 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 41 predicate places.
[2023-08-26 12:03:28,794 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 169 transitions, 1977 flow
[2023-08-26 12:03:28,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.83333333333333) internal successors, (725), 6 states have internal predecessors, (725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:28,795 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:28,795 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]
[2023-08-26 12:03:28,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-08-26 12:03:28,795 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:28,795 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash -757775396, now seen corresponding path program 1 times
[2023-08-26 12:03:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363671699]
[2023-08-26 12:03:28,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:28,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:29,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:29,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363671699]
[2023-08-26 12:03:29,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363671699] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:29,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:29,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:29,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699377816]
[2023-08-26 12:03:29,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:29,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:29,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:29,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:29,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:29,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 290
[2023-08-26 12:03:29,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 169 transitions, 1977 flow. Second operand has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:29,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:29,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 290
[2023-08-26 12:03:29,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:31,122 INFO L124 PetriNetUnfolderBase]: 13943/19771 cut-off events.
[2023-08-26 12:03:31,123 INFO L125 PetriNetUnfolderBase]: For 134760/134760 co-relation queries the response was YES.
[2023-08-26 12:03:31,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119207 conditions, 19771 events. 13943/19771 cut-off events. For 134760/134760 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 112874 event pairs, 2342 based on Foata normal form. 13/19784 useless extension candidates. Maximal degree in co-relation 119177. Up to 10853 conditions per place.
[2023-08-26 12:03:31,326 INFO L140 encePairwiseOnDemand]: 276/290 looper letters, 161 selfloop transitions, 94 changer transitions 170/425 dead transitions.
[2023-08-26 12:03:31,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 425 transitions, 5618 flow
[2023-08-26 12:03:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-26 12:03:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-26 12:03:31,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 749 transitions.
[2023-08-26 12:03:31,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4304597701149425
[2023-08-26 12:03:31,342 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 749 transitions.
[2023-08-26 12:03:31,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 749 transitions.
[2023-08-26 12:03:31,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:31,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 749 transitions.
[2023-08-26 12:03:31,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.83333333333333) internal successors, (749), 6 states have internal predecessors, (749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:31,345 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:31,346 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:31,346 INFO L175 Difference]: Start difference. First operand has 92 places, 169 transitions, 1977 flow. Second operand 6 states and 749 transitions.
[2023-08-26 12:03:31,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 425 transitions, 5618 flow
[2023-08-26 12:03:32,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 425 transitions, 5257 flow, removed 122 selfloop flow, removed 4 redundant places.
[2023-08-26 12:03:32,484 INFO L231 Difference]: Finished difference. Result has 97 places, 185 transitions, 2497 flow
[2023-08-26 12:03:32,485 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1880, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2497, PETRI_PLACES=97, PETRI_TRANSITIONS=185}
[2023-08-26 12:03:32,485 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 46 predicate places.
[2023-08-26 12:03:32,485 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 185 transitions, 2497 flow
[2023-08-26 12:03:32,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.8) internal successors, (559), 5 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:32,485 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:32,485 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]
[2023-08-26 12:03:32,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2023-08-26 12:03:32,486 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:32,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:32,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1402322958, now seen corresponding path program 2 times
[2023-08-26 12:03:32,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:32,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482554120]
[2023-08-26 12:03:32,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:32,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:32,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:32,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:32,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:32,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482554120]
[2023-08-26 12:03:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482554120] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:32,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:32,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-26 12:03:32,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548643673]
[2023-08-26 12:03:32,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:32,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-08-26 12:03:32,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:32,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-08-26 12:03:32,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2023-08-26 12:03:32,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 290
[2023-08-26 12:03:32,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 185 transitions, 2497 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:32,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:32,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 290
[2023-08-26 12:03:32,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:33,414 INFO L124 PetriNetUnfolderBase]: 4004/5948 cut-off events.
[2023-08-26 12:03:33,415 INFO L125 PetriNetUnfolderBase]: For 55485/56680 co-relation queries the response was YES.
[2023-08-26 12:03:33,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37072 conditions, 5948 events. 4004/5948 cut-off events. For 55485/56680 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 32955 event pairs, 443 based on Foata normal form. 296/6027 useless extension candidates. Maximal degree in co-relation 37038. Up to 3493 conditions per place.
[2023-08-26 12:03:33,451 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 212 selfloop transitions, 18 changer transitions 61/326 dead transitions.
[2023-08-26 12:03:33,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 326 transitions, 4881 flow
[2023-08-26 12:03:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2023-08-26 12:03:33,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-08-26 12:03:33,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1030 transitions.
[2023-08-26 12:03:33,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44396551724137934
[2023-08-26 12:03:33,453 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1030 transitions.
[2023-08-26 12:03:33,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1030 transitions.
[2023-08-26 12:03:33,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:33,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1030 transitions.
[2023-08-26 12:03:33,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 128.75) internal successors, (1030), 8 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:33,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:33,458 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:33,458 INFO L175 Difference]: Start difference. First operand has 97 places, 185 transitions, 2497 flow. Second operand 8 states and 1030 transitions.
[2023-08-26 12:03:33,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 326 transitions, 4881 flow
[2023-08-26 12:03:33,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 326 transitions, 4710 flow, removed 45 selfloop flow, removed 8 redundant places.
[2023-08-26 12:03:33,559 INFO L231 Difference]: Finished difference. Result has 93 places, 152 transitions, 1938 flow
[2023-08-26 12:03:33,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=2353, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1938, PETRI_PLACES=93, PETRI_TRANSITIONS=152}
[2023-08-26 12:03:33,559 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 42 predicate places.
[2023-08-26 12:03:33,559 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 152 transitions, 1938 flow
[2023-08-26 12:03:33,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:33,560 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:33,560 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]
[2023-08-26 12:03:33,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2023-08-26 12:03:33,560 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:33,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1344083961, now seen corresponding path program 1 times
[2023-08-26 12:03:33,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:33,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736782499]
[2023-08-26 12:03:33,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:33,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:33,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:33,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:33,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736782499]
[2023-08-26 12:03:33,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736782499] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:33,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:33,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-08-26 12:03:33,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770924579]
[2023-08-26 12:03:33,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:33,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-08-26 12:03:33,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:33,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-08-26 12:03:33,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-08-26 12:03:33,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 290
[2023-08-26 12:03:33,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 152 transitions, 1938 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:33,806 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:33,806 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 290
[2023-08-26 12:03:33,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:34,622 INFO L124 PetriNetUnfolderBase]: 4704/7010 cut-off events.
[2023-08-26 12:03:34,622 INFO L125 PetriNetUnfolderBase]: For 42091/42091 co-relation queries the response was YES.
[2023-08-26 12:03:34,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41957 conditions, 7010 events. 4704/7010 cut-off events. For 42091/42091 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 37115 event pairs, 823 based on Foata normal form. 1/7011 useless extension candidates. Maximal degree in co-relation 41927. Up to 3640 conditions per place.
[2023-08-26 12:03:34,654 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 91 selfloop transitions, 11 changer transitions 118/220 dead transitions.
[2023-08-26 12:03:34,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 220 transitions, 3057 flow
[2023-08-26 12:03:34,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2023-08-26 12:03:34,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-08-26 12:03:34,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions.
[2023-08-26 12:03:34,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42586206896551726
[2023-08-26 12:03:34,656 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions.
[2023-08-26 12:03:34,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions.
[2023-08-26 12:03:34,656 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:34,656 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions.
[2023-08-26 12:03:34,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:34,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:34,658 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:34,658 INFO L175 Difference]: Start difference. First operand has 93 places, 152 transitions, 1938 flow. Second operand 4 states and 494 transitions.
[2023-08-26 12:03:34,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 220 transitions, 3057 flow
[2023-08-26 12:03:34,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 220 transitions, 2910 flow, removed 44 selfloop flow, removed 8 redundant places.
[2023-08-26 12:03:34,803 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 869 flow
[2023-08-26 12:03:34,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1859, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=869, PETRI_PLACES=87, PETRI_TRANSITIONS=84}
[2023-08-26 12:03:34,804 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places.
[2023-08-26 12:03:34,804 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 869 flow
[2023-08-26 12:03:34,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:34,804 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:34,804 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]
[2023-08-26 12:03:34,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2023-08-26 12:03:34,805 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:34,805 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash 774738655, now seen corresponding path program 2 times
[2023-08-26 12:03:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908546017]
[2023-08-26 12:03:34,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:35,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:35,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:35,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908546017]
[2023-08-26 12:03:35,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908546017] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:35,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:35,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-08-26 12:03:35,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876561054]
[2023-08-26 12:03:35,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:35,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-08-26 12:03:35,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:35,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-08-26 12:03:35,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-08-26 12:03:35,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 290
[2023-08-26 12:03:35,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 869 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:35,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:35,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 290
[2023-08-26 12:03:35,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:35,571 INFO L124 PetriNetUnfolderBase]: 2742/4174 cut-off events.
[2023-08-26 12:03:35,572 INFO L125 PetriNetUnfolderBase]: For 20027/20027 co-relation queries the response was YES.
[2023-08-26 12:03:35,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22042 conditions, 4174 events. 2742/4174 cut-off events. For 20027/20027 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 21061 event pairs, 468 based on Foata normal form. 1/4175 useless extension candidates. Maximal degree in co-relation 22015. Up to 2067 conditions per place.
[2023-08-26 12:03:35,590 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 55 selfloop transitions, 10 changer transitions 93/158 dead transitions.
[2023-08-26 12:03:35,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 158 transitions, 1821 flow
[2023-08-26 12:03:35,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2023-08-26 12:03:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-08-26 12:03:35,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 713 transitions.
[2023-08-26 12:03:35,592 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40977011494252874
[2023-08-26 12:03:35,592 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 713 transitions.
[2023-08-26 12:03:35,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 713 transitions.
[2023-08-26 12:03:35,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:35,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 713 transitions.
[2023-08-26 12:03:35,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:35,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:35,595 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:35,595 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 869 flow. Second operand 6 states and 713 transitions.
[2023-08-26 12:03:35,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 158 transitions, 1821 flow
[2023-08-26 12:03:35,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 158 transitions, 1678 flow, removed 26 selfloop flow, removed 9 redundant places.
[2023-08-26 12:03:35,641 INFO L231 Difference]: Finished difference. Result has 83 places, 54 transitions, 464 flow
[2023-08-26 12:03:35,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=464, PETRI_PLACES=83, PETRI_TRANSITIONS=54}
[2023-08-26 12:03:35,641 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places.
[2023-08-26 12:03:35,641 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 54 transitions, 464 flow
[2023-08-26 12:03:35,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:35,641 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:35,642 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]
[2023-08-26 12:03:35,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2023-08-26 12:03:35,642 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:35,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:35,642 INFO L85 PathProgramCache]: Analyzing trace with hash 234475093, now seen corresponding path program 3 times
[2023-08-26 12:03:35,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:35,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888628320]
[2023-08-26 12:03:35,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:35,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-08-26 12:03:36,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-08-26 12:03:36,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-08-26 12:03:36,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888628320]
[2023-08-26 12:03:36,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888628320] provided 1 perfect and 0 imperfect interpolant sequences
[2023-08-26 12:03:36,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-08-26 12:03:36,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-08-26 12:03:36,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154477911]
[2023-08-26 12:03:36,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-08-26 12:03:36,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-08-26 12:03:36,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-08-26 12:03:36,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-08-26 12:03:36,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56
[2023-08-26 12:03:36,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 290
[2023-08-26 12:03:36,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 54 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:36,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-08-26 12:03:36,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 290
[2023-08-26 12:03:36,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-08-26 12:03:36,527 INFO L124 PetriNetUnfolderBase]: 1098/1785 cut-off events.
[2023-08-26 12:03:36,527 INFO L125 PetriNetUnfolderBase]: For 8595/8635 co-relation queries the response was YES.
[2023-08-26 12:03:36,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8872 conditions, 1785 events. 1098/1785 cut-off events. For 8595/8635 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 8216 event pairs, 193 based on Foata normal form. 5/1743 useless extension candidates. Maximal degree in co-relation 8848. Up to 1030 conditions per place.
[2023-08-26 12:03:36,534 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 64 selfloop transitions, 11 changer transitions 8/88 dead transitions.
[2023-08-26 12:03:36,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 88 transitions, 834 flow
[2023-08-26 12:03:36,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2023-08-26 12:03:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-08-26 12:03:36,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 627 transitions.
[2023-08-26 12:03:36,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4324137931034483
[2023-08-26 12:03:36,536 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 627 transitions.
[2023-08-26 12:03:36,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 627 transitions.
[2023-08-26 12:03:36,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-08-26 12:03:36,536 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 627 transitions.
[2023-08-26 12:03:36,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.4) internal successors, (627), 5 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:36,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:36,538 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:36,538 INFO L175 Difference]: Start difference. First operand has 83 places, 54 transitions, 464 flow. Second operand 5 states and 627 transitions.
[2023-08-26 12:03:36,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 88 transitions, 834 flow
[2023-08-26 12:03:36,552 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 88 transitions, 774 flow, removed 11 selfloop flow, removed 12 redundant places.
[2023-08-26 12:03:36,552 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 476 flow
[2023-08-26 12:03:36,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=416, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=476, PETRI_PLACES=72, PETRI_TRANSITIONS=56}
[2023-08-26 12:03:36,553 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 21 predicate places.
[2023-08-26 12:03:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 476 flow
[2023-08-26 12:03:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-08-26 12:03:36,553 INFO L200 CegarLoopForPetriNet]: Found error trace
[2023-08-26 12:03:36,553 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]
[2023-08-26 12:03:36,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2023-08-26 12:03:36,554 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] ===
[2023-08-26 12:03:36,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier
[2023-08-26 12:03:36,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1918395997, now seen corresponding path program 4 times
[2023-08-26 12:03:36,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-08-26 12:03:36,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648303515]
[2023-08-26 12:03:36,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-08-26 12:03:36,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-08-26 12:03:36,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-26 12:03:36,582 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-08-26 12:03:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-08-26 12:03:36,660 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-08-26 12:03:36,660 INFO L360 BasicCegarLoop]: Counterexample is feasible
[2023-08-26 12:03:36,660 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONASSERT (14 of 15 remaining)
[2023-08-26 12:03:36,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (13 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining)
[2023-08-26 12:03:36,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining)
[2023-08-26 12:03:36,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining)
[2023-08-26 12:03:36,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 15 remaining)
[2023-08-26 12:03:36,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 15 remaining)
[2023-08-26 12:03:36,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 15 remaining)
[2023-08-26 12:03:36,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 15 remaining)
[2023-08-26 12:03:36,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2023-08-26 12:03:36,663 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-08-26 12:03:36,667 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-08-26 12:03:36,667 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2023-08-26 12:03:36,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:03:36 BasicIcfg
[2023-08-26 12:03:36,749 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-08-26 12:03:36,749 INFO L158 Benchmark]: Toolchain (without parser) took 36454.87ms. Allocated memory was 335.5MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 309.7MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,749 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 335.5MB. Free memory was 311.5MB in the beginning and 311.3MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB.
[2023-08-26 12:03:36,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.70ms. Allocated memory is still 335.5MB. Free memory was 309.1MB in the beginning and 285.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,750 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.04ms. Allocated memory is still 335.5MB. Free memory was 285.0MB in the beginning and 282.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,750 INFO L158 Benchmark]: Boogie Preprocessor took 34.25ms. Allocated memory is still 335.5MB. Free memory was 282.2MB in the beginning and 280.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,750 INFO L158 Benchmark]: RCFGBuilder took 658.14ms. Allocated memory is still 335.5MB. Free memory was 280.2MB in the beginning and 294.3MB in the end (delta: -14.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,750 INFO L158 Benchmark]: TraceAbstraction took 35274.07ms. Allocated memory was 335.5MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 294.3MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB.
[2023-08-26 12:03:36,751 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.10ms. Allocated memory is still 335.5MB. Free memory was 311.5MB in the beginning and 311.3MB in the end (delta: 176.0kB). There was no memory consumed. Max. memory is 16.0GB.
* CACSL2BoogieTranslator took 416.70ms. Allocated memory is still 335.5MB. Free memory was 309.1MB in the beginning and 285.5MB in the end (delta: 23.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB.
* Boogie Procedure Inliner took 67.04ms. Allocated memory is still 335.5MB. Free memory was 285.0MB in the beginning and 282.2MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
* Boogie Preprocessor took 34.25ms. Allocated memory is still 335.5MB. Free memory was 282.2MB in the beginning and 280.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB.
* RCFGBuilder took 658.14ms. Allocated memory is still 335.5MB. Free memory was 280.2MB in the beginning and 294.3MB in the end (delta: -14.1MB). Peak memory consumption was 31.6MB. Max. memory is 16.0GB.
* TraceAbstraction took 35274.07ms. Allocated memory was 335.5MB in the beginning and 3.7GB in the end (delta: 3.4GB). Free memory was 294.3MB in the beginning and 2.1GB in the end (delta: -1.8GB). Peak memory consumption was 1.5GB. Max. memory is 16.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResultAtLocation [Line: 267]: Unsoundness Warning
unspecified type, defaulting to int C: short [267]
- GenericResultAtLocation [Line: 267]: Unsoundness Warning
unspecified type, defaulting to int C: short [267]
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: PetriNetLargeBlockEncoding benchmarks
Lipton Reduction Statistics: ReductionTime: 4.5s, 148 PlacesBefore, 51 PlacesAfterwards, 138 TransitionsBefore, 38 TransitionsAfterwards, 3566 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 3 ChoiceCompositions, 148 TotalNumberOfCompositions, 10701 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5042, independent: 4793, independent conditional: 0, independent unconditional: 4793, dependent: 249, dependent conditional: 0, dependent unconditional: 249, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1981, independent: 1935, independent conditional: 0, independent unconditional: 1935, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5042, independent: 2858, independent conditional: 0, independent unconditional: 2858, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 1981, unknown conditional: 0, unknown unconditional: 1981] , Statistics on independence cache: Total cache size (in pairs): 188, Positive cache size: 169, Positive conditional cache size: 0, Positive unconditional cache size: 169, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
- CounterExampleResult [Line: 17]: assertion can be violated
assertion can be violated
We found a FailurePath:
[L710] 0 int __unbuffered_cnt = 0;
[L712] 0 int __unbuffered_p1_EAX = 0;
[L714] 0 int __unbuffered_p3_EAX = 0;
[L716] 0 int __unbuffered_p3_EBX = 0;
[L718] 0 int a = 0;
[L719] 0 _Bool main$tmp_guard0;
[L720] 0 _Bool main$tmp_guard1;
[L722] 0 int x = 0;
[L723] 0 _Bool x$flush_delayed;
[L724] 0 int x$mem_tmp;
[L725] 0 _Bool x$r_buff0_thd0;
[L726] 0 _Bool x$r_buff0_thd1;
[L727] 0 _Bool x$r_buff0_thd2;
[L728] 0 _Bool x$r_buff0_thd3;
[L729] 0 _Bool x$r_buff0_thd4;
[L730] 0 _Bool x$r_buff1_thd0;
[L731] 0 _Bool x$r_buff1_thd1;
[L732] 0 _Bool x$r_buff1_thd2;
[L733] 0 _Bool x$r_buff1_thd3;
[L734] 0 _Bool x$r_buff1_thd4;
[L735] 0 _Bool x$read_delayed;
[L736] 0 int *x$read_delayed_var;
[L737] 0 int x$w_buff0;
[L738] 0 _Bool x$w_buff0_used;
[L739] 0 int x$w_buff1;
[L740] 0 _Bool x$w_buff1_used;
[L742] 0 int y = 0;
[L744] 0 int z = 0;
[L745] 0 _Bool weak$$choice0;
[L746] 0 _Bool weak$$choice2;
[L851] 0 pthread_t t737;
[L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t737, ((void *)0), P0, ((void *)0))=-4, t737={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L853] 0 pthread_t t738;
[L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t738, ((void *)0), P1, ((void *)0))=-3, t737={5:0}, t738={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L855] 0 pthread_t t739;
[L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t739, ((void *)0), P2, ((void *)0))=-2, t737={5:0}, t738={6:0}, t739={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L857] 0 pthread_t t740;
[L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t740, ((void *)0), P3, ((void *)0))=-1, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L770] 2 x$w_buff1 = x$w_buff0
[L771] 2 x$w_buff0 = 2
[L772] 2 x$w_buff1_used = x$w_buff0_used
[L773] 2 x$w_buff0_used = (_Bool)1
[L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L18] COND FALSE 2 !(!expression)
[L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used))
[L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0
[L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1
[L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2
[L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3
[L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4
[L780] 2 x$r_buff0_thd2 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L783] 2 __unbuffered_p1_EAX = y
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0]
[L800] 3 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0]
[L803] 3 z = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1]
[L820] 4 z = 2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L823] 4 __unbuffered_p3_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L826] 4 __unbuffered_p3_EBX = a
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L750] 1 a = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2]
[L753] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2]
[L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)
[L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used
[L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used
[L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2
[L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1
[L795] 2 return 0;
[L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)
[L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used
[L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used
[L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1
[L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x)
[L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used
[L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used
[L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3
[L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3
VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1
[L765] 1 return 0;
[L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x)
[L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used
[L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used
[L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4
[L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1
[L815] 3 return 0;
[L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1
[L838] 4 return 0;
[L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4
[L862] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
[L862] RET 0 assume_abort_if_not(main$tmp_guard0)
[L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x)
[L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used
[L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used
[L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0
[L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
[L871] 0 weak$$choice0 = __VERIFIER_nondet_bool()
[L872] 0 weak$$choice2 = __VERIFIER_nondet_bool()
[L873] 0 x$flush_delayed = weak$$choice2
[L874] 0 x$mem_tmp = x
[L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1)
[L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0))
[L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1))
[L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used))
[L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0))
[L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L883] 0 x = x$flush_delayed ? x$mem_tmp : x
[L884] 0 x$flush_delayed = (_Bool)0
[L886] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
[L18] CALL 0 reach_error()
[L17] COND FALSE 0 !(0)
[L17] 0 __assert_fail ("0", "mix027_tso.c", 8, __extension__ __PRETTY_FUNCTION__)
VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2]
- UnprovableResult [Line: 17]: Unable to prove that assertion always holds
Unable to prove that assertion always holds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds
Unable to prove that pointer dereference always succeeds
Reason: Not analyzed.
- UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users)
Reason: Not analyzed.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 9 procedures, 178 locations, 15 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: 35.1s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 725 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 725 mSDsluCounter, 119 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2012 IncrementalHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 62 mSDtfsCounter, 2012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2497occurred in iteration=15, InterpolantAutomatonStates: 96, 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.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 3092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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!
[2023-08-26 12:03:36,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...