/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m [2023-11-17 11:25:43,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-17 11:25:43,910 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-SemanticLbe.epf [2023-11-17 11:25:43,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-17 11:25:43,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-17 11:25:43,932 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-17 11:25:43,932 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-17 11:25:43,932 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-17 11:25:43,933 INFO L153 SettingsManager]: * Use SBE=true [2023-11-17 11:25:43,933 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-17 11:25:43,933 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-17 11:25:43,933 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-17 11:25:43,934 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-17 11:25:43,934 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-17 11:25:43,934 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-17 11:25:43,934 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-17 11:25:43,935 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-17 11:25:43,935 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-17 11:25:43,941 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-17 11:25:43,941 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-17 11:25:43,941 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-17 11:25:43,942 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-17 11:25:43,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-17 11:25:43,942 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-17 11:25:43,942 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-17 11:25:43,942 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:43,942 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-17 11:25:43,942 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-17 11:25:43,943 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-17 11:25:43,943 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-17 11:25:43,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-17 11:25:43,943 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-17 11:25:43,943 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true [2023-11-17 11:25:44,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-17 11:25:44,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-17 11:25:44,107 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-17 11:25:44,108 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-17 11:25:44,108 INFO L274 PluginConnector]: CDTParser initialized [2023-11-17 11:25:44,109 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:45,282 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-17 11:25:45,596 INFO L384 CDTParser]: Found 1 translation units. [2023-11-17 11:25:45,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:45,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401ade4e6/8da380dcb6c3472da631ed24dd6f1dc7/FLAGd8d27a774 [2023-11-17 11:25:45,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/401ade4e6/8da380dcb6c3472da631ed24dd6f1dc7 [2023-11-17 11:25:45,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-17 11:25:45,641 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-17 11:25:45,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:45,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-17 11:25:45,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-17 11:25:45,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:45" (1/1) ... [2023-11-17 11:25:45,648 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2960d29c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:45, skipping insertion in model container [2023-11-17 11:25:45,648 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:45" (1/1) ... [2023-11-17 11:25:45,679 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-17 11:25:45,786 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 11:25:45,976 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:45,988 INFO L202 MainTranslator]: Completed pre-run [2023-11-17 11:25:45,997 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_power.opt_pso.opt_rmo.opt.i[966,979] [2023-11-17 11:25:46,045 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-17 11:25:46,067 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:46,067 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-17 11:25:46,073 INFO L206 MainTranslator]: Completed translation [2023-11-17 11:25:46,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46 WrapperNode [2023-11-17 11:25:46,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-17 11:25:46,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:46,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-17 11:25:46,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-17 11:25:46,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,113 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,146 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 159 [2023-11-17 11:25:46,146 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-17 11:25:46,147 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-17 11:25:46,147 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-17 11:25:46,147 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-17 11:25:46,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,167 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,169 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,172 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-17 11:25:46,187 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-17 11:25:46,187 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-17 11:25:46,187 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-17 11:25:46,188 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (1/1) ... [2023-11-17 11:25:46,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-17 11:25:46,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-17 11:25:46,217 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-11-17 11:25:46,231 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-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-17 11:25:46,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-17 11:25:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-17 11:25:46,237 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-17 11:25:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-17 11:25:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-17 11:25:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-17 11:25:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-17 11:25:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-17 11:25:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-17 11:25:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-17 11:25:46,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-17 11:25:46,239 WARN L211 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-17 11:25:46,349 INFO L239 CfgBuilder]: Building ICFG [2023-11-17 11:25:46,351 INFO L265 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-17 11:25:46,583 INFO L280 CfgBuilder]: Performing block encoding [2023-11-17 11:25:46,756 INFO L302 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-17 11:25:46,756 INFO L307 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-17 11:25:46,757 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:46 BoogieIcfgContainer [2023-11-17 11:25:46,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-17 11:25:46,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-17 11:25:46,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-17 11:25:46,762 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-17 11:25:46,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:25:45" (1/3) ... [2023-11-17 11:25:46,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a32e38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:46, skipping insertion in model container [2023-11-17 11:25:46,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:46" (2/3) ... [2023-11-17 11:25:46,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a32e38d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:46, skipping insertion in model container [2023-11-17 11:25:46,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:46" (3/3) ... [2023-11-17 11:25:46,765 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_power.opt_pso.opt_rmo.opt.i [2023-11-17 11:25:46,777 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-17 11:25:46,778 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-17 11:25:46,778 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-17 11:25:46,825 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-17 11:25:46,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow [2023-11-17 11:25:46,889 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-17 11:25:46,889 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:46,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-17 11:25:46,895 INFO L82 GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow [2023-11-17 11:25:46,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow [2023-11-17 11:25:46,901 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-17 11:25:46,913 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 102 flow [2023-11-17 11:25:46,916 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 45 transitions, 102 flow [2023-11-17 11:25:46,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 102 flow [2023-11-17 11:25:46,930 INFO L124 PetriNetUnfolderBase]: 1/45 cut-off events. [2023-11-17 11:25:46,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:46,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 94 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2023-11-17 11:25:46,931 INFO L119 LiptonReduction]: Number of co-enabled transitions 1226 [2023-11-17 11:25:48,199 INFO L134 LiptonReduction]: Checked pairs total: 3129 [2023-11-17 11:25:48,199 INFO L136 LiptonReduction]: Total number of compositions: 21 [2023-11-17 11:25:48,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-17 11:25:48,215 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=LoopHeads, 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;@5bcf7213, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-17 11:25:48,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-17 11:25:48,219 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-17 11:25:48,219 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-11-17 11:25:48,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-17 11:25:48,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:48,220 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:48,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:48,224 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:48,224 INFO L85 PathProgramCache]: Analyzing trace with hash 724699528, now seen corresponding path program 1 times [2023-11-17 11:25:48,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614522197] [2023-11-17 11:25:48,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:48,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:48,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:48,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614522197] [2023-11-17 11:25:48,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614522197] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:48,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:48,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841508974] [2023-11-17 11:25:48,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:48,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:48,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:48,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:48,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 70 [2023-11-17 11:25:48,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-17 11:25:48,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:48,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 70 [2023-11-17 11:25:48,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:49,252 INFO L124 PetriNetUnfolderBase]: 2855/4259 cut-off events. [2023-11-17 11:25:49,252 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-11-17 11:25:49,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8335 conditions, 4259 events. 2855/4259 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 24064 event pairs, 545 based on Foata normal form. 0/4015 useless extension candidates. Maximal degree in co-relation 8323. Up to 3103 conditions per place. [2023-11-17 11:25:49,329 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions. [2023-11-17 11:25:49,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 173 flow [2023-11-17 11:25:49,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2023-11-17 11:25:49,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5380952380952381 [2023-11-17 11:25:49,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 113 transitions. [2023-11-17 11:25:49,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions. [2023-11-17 11:25:49,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:49,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions. [2023-11-17 11:25:49,354 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 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-11-17 11:25:49,356 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:49,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:49,358 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 113 transitions. [2023-11-17 11:25:49,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 173 flow [2023-11-17 11:25:49,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-17 11:25:49,362 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow [2023-11-17 11:25:49,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-17 11:25:49,366 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-17 11:25:49,366 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow [2023-11-17 11:25:49,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 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-11-17 11:25:49,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:49,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:49,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-17 11:25:49,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:49,373 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash -997950945, now seen corresponding path program 1 times [2023-11-17 11:25:49,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:49,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314325097] [2023-11-17 11:25:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:49,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:49,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:49,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314325097] [2023-11-17 11:25:49,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314325097] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:49,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:49,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:49,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849286635] [2023-11-17 11:25:49,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:49,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:49,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:49,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:49,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:49,618 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:49,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-17 11:25:49,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:49,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:49,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:49,960 INFO L124 PetriNetUnfolderBase]: 2551/3700 cut-off events. [2023-11-17 11:25:49,961 INFO L125 PetriNetUnfolderBase]: For 231/231 co-relation queries the response was YES. [2023-11-17 11:25:49,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7614 conditions, 3700 events. 2551/3700 cut-off events. For 231/231 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 18513 event pairs, 1015 based on Foata normal form. 96/3780 useless extension candidates. Maximal degree in co-relation 7604. Up to 2209 conditions per place. [2023-11-17 11:25:49,982 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 31 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-17 11:25:49,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 37 transitions, 154 flow [2023-11-17 11:25:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:49,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2023-11-17 11:25:49,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047619047619047 [2023-11-17 11:25:49,986 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 106 transitions. [2023-11-17 11:25:49,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 106 transitions. [2023-11-17 11:25:49,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:49,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 106 transitions. [2023-11-17 11:25:49,989 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-17 11:25:49,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:49,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:49,990 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 3 states and 106 transitions. [2023-11-17 11:25:49,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 37 transitions, 154 flow [2023-11-17 11:25:49,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 37 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:49,992 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 70 flow [2023-11-17 11:25:49,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-11-17 11:25:49,993 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places. [2023-11-17 11:25:49,994 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 70 flow [2023-11-17 11:25:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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-11-17 11:25:49,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:49,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:49,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-17 11:25:49,997 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:50,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:50,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1253233477, now seen corresponding path program 1 times [2023-11-17 11:25:50,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:50,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336822000] [2023-11-17 11:25:50,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:50,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:50,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:50,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336822000] [2023-11-17 11:25:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336822000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:50,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-17 11:25:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064582643] [2023-11-17 11:25:50,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:50,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:25:50,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:50,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:25:50,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:25:50,192 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 70 [2023-11-17 11:25:50,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-17 11:25:50,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:50,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 70 [2023-11-17 11:25:50,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:50,575 INFO L124 PetriNetUnfolderBase]: 2869/4234 cut-off events. [2023-11-17 11:25:50,575 INFO L125 PetriNetUnfolderBase]: For 186/201 co-relation queries the response was YES. [2023-11-17 11:25:50,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8575 conditions, 4234 events. 2869/4234 cut-off events. For 186/201 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 23055 event pairs, 527 based on Foata normal form. 30/4215 useless extension candidates. Maximal degree in co-relation 8564. Up to 3669 conditions per place. [2023-11-17 11:25:50,597 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 37 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-17 11:25:50,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 44 transitions, 190 flow [2023-11-17 11:25:50,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:50,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:50,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-17 11:25:50,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-11-17 11:25:50,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-17 11:25:50,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-17 11:25:50,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:50,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-17 11:25:50,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-17 11:25:50,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:50,603 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:50,603 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 70 flow. Second operand 3 states and 110 transitions. [2023-11-17 11:25:50,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 44 transitions, 190 flow [2023-11-17 11:25:50,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 44 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-17 11:25:50,605 INFO L231 Difference]: Finished difference. Result has 40 places, 29 transitions, 85 flow [2023-11-17 11:25:50,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=40, PETRI_TRANSITIONS=29} [2023-11-17 11:25:50,606 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2023-11-17 11:25:50,606 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 29 transitions, 85 flow [2023-11-17 11:25:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-17 11:25:50,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:50,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:50,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-17 11:25:50,607 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:50,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash -195516317, now seen corresponding path program 1 times [2023-11-17 11:25:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:50,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179497231] [2023-11-17 11:25:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179497231] [2023-11-17 11:25:50,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179497231] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:50,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:50,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:25:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240825287] [2023-11-17 11:25:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:50,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:25:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:25:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:25:50,938 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:50,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 29 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-17 11:25:50,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:50,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:50,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:51,339 INFO L124 PetriNetUnfolderBase]: 3247/4760 cut-off events. [2023-11-17 11:25:51,339 INFO L125 PetriNetUnfolderBase]: For 887/904 co-relation queries the response was YES. [2023-11-17 11:25:51,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10298 conditions, 4760 events. 3247/4760 cut-off events. For 887/904 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 24399 event pairs, 1224 based on Foata normal form. 24/4741 useless extension candidates. Maximal degree in co-relation 10286. Up to 4237 conditions per place. [2023-11-17 11:25:51,370 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 36 selfloop transitions, 3 changer transitions 0/44 dead transitions. [2023-11-17 11:25:51,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 202 flow [2023-11-17 11:25:51,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:25:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:25:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2023-11-17 11:25:51,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2023-11-17 11:25:51,372 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 110 transitions. [2023-11-17 11:25:51,373 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions. [2023-11-17 11:25:51,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:51,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions. [2023-11-17 11:25:51,373 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-17 11:25:51,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:51,375 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:25:51,375 INFO L175 Difference]: Start difference. First operand has 40 places, 29 transitions, 85 flow. Second operand 3 states and 110 transitions. [2023-11-17 11:25:51,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 202 flow [2023-11-17 11:25:51,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 44 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:51,376 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 101 flow [2023-11-17 11:25:51,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=101, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2023-11-17 11:25:51,378 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places. [2023-11-17 11:25:51,378 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 101 flow [2023-11-17 11:25:51,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-17 11:25:51,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:51,379 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:51,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-17 11:25:51,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:51,379 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash -896019089, now seen corresponding path program 1 times [2023-11-17 11:25:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783374021] [2023-11-17 11:25:51,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:51,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:51,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:51,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783374021] [2023-11-17 11:25:51,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783374021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:51,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:51,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:51,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319657102] [2023-11-17 11:25:51,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:51,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:51,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:51,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:51,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:51,626 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:51,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 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-11-17 11:25:51,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:51,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:51,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:52,092 INFO L124 PetriNetUnfolderBase]: 3346/5021 cut-off events. [2023-11-17 11:25:52,092 INFO L125 PetriNetUnfolderBase]: For 1746/1825 co-relation queries the response was YES. [2023-11-17 11:25:52,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11556 conditions, 5021 events. 3346/5021 cut-off events. For 1746/1825 co-relation queries the response was YES. Maximal size of possible extension queue 247. Compared 27417 event pairs, 594 based on Foata normal form. 36/5014 useless extension candidates. Maximal degree in co-relation 11542. Up to 3627 conditions per place. [2023-11-17 11:25:52,120 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 45 selfloop transitions, 8 changer transitions 0/58 dead transitions. [2023-11-17 11:25:52,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 279 flow [2023-11-17 11:25:52,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:52,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:52,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-17 11:25:52,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2023-11-17 11:25:52,121 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:52,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,122 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11-17 11:25:52,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:52,123 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:52,123 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 101 flow. Second operand 4 states and 147 transitions. [2023-11-17 11:25:52,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 279 flow [2023-11-17 11:25:52,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 276 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:52,126 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 137 flow [2023-11-17 11:25:52,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=137, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-11-17 11:25:52,128 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-11-17 11:25:52,128 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 137 flow [2023-11-17 11:25:52,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 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-11-17 11:25:52,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:52,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:52,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-17 11:25:52,129 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:52,129 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:52,129 INFO L85 PathProgramCache]: Analyzing trace with hash -928308689, now seen corresponding path program 2 times [2023-11-17 11:25:52,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:52,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556660990] [2023-11-17 11:25:52,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:52,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:52,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:52,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:52,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556660990] [2023-11-17 11:25:52,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556660990] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:52,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:52,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987176755] [2023-11-17 11:25:52,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:52,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:52,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:52,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:52,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:52,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:52,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 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-11-17 11:25:52,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:52,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:52,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:52,876 INFO L124 PetriNetUnfolderBase]: 3335/4892 cut-off events. [2023-11-17 11:25:52,876 INFO L125 PetriNetUnfolderBase]: For 3714/4071 co-relation queries the response was YES. [2023-11-17 11:25:52,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12914 conditions, 4892 events. 3335/4892 cut-off events. For 3714/4071 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24798 event pairs, 920 based on Foata normal form. 56/4905 useless extension candidates. Maximal degree in co-relation 12898. Up to 3631 conditions per place. [2023-11-17 11:25:52,905 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 46 selfloop transitions, 10 changer transitions 0/61 dead transitions. [2023-11-17 11:25:52,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 333 flow [2023-11-17 11:25:52,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:52,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2023-11-17 11:25:52,906 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.525 [2023-11-17 11:25:52,906 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,906 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,906 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:52,906 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 147 transitions. [2023-11-17 11:25:52,907 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 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-11-17 11:25:52,908 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:52,908 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:52,908 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 137 flow. Second operand 4 states and 147 transitions. [2023-11-17 11:25:52,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 333 flow [2023-11-17 11:25:52,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 326 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:52,914 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 177 flow [2023-11-17 11:25:52,914 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-11-17 11:25:52,915 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2023-11-17 11:25:52,916 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 177 flow [2023-11-17 11:25:52,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 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-11-17 11:25:52,916 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:52,916 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:52,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-17 11:25:52,916 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:52,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -895980649, now seen corresponding path program 1 times [2023-11-17 11:25:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220121174] [2023-11-17 11:25:52,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:52,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220121174] [2023-11-17 11:25:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220121174] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718231149] [2023-11-17 11:25:53,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:53,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:53,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:53,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:53,560 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70 [2023-11-17 11:25:53,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 177 flow. Second operand has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-17 11:25:53,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:53,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70 [2023-11-17 11:25:53,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:54,611 INFO L124 PetriNetUnfolderBase]: 9874/13547 cut-off events. [2023-11-17 11:25:54,611 INFO L125 PetriNetUnfolderBase]: For 15959/15959 co-relation queries the response was YES. [2023-11-17 11:25:54,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37153 conditions, 13547 events. 9874/13547 cut-off events. For 15959/15959 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 68503 event pairs, 865 based on Foata normal form. 248/13795 useless extension candidates. Maximal degree in co-relation 37135. Up to 8563 conditions per place. [2023-11-17 11:25:54,670 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 78 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2023-11-17 11:25:54,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 104 transitions, 621 flow [2023-11-17 11:25:54,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:54,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:54,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 174 transitions. [2023-11-17 11:25:54,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49714285714285716 [2023-11-17 11:25:54,672 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 174 transitions. [2023-11-17 11:25:54,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 174 transitions. [2023-11-17 11:25:54,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:54,672 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 174 transitions. [2023-11-17 11:25:54,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 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-11-17 11:25:54,673 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:25:54,673 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:25:54,673 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 177 flow. Second operand 5 states and 174 transitions. [2023-11-17 11:25:54,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 104 transitions, 621 flow [2023-11-17 11:25:54,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 609 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:54,682 INFO L231 Difference]: Finished difference. Result has 54 places, 61 transitions, 426 flow [2023-11-17 11:25:54,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=426, PETRI_PLACES=54, PETRI_TRANSITIONS=61} [2023-11-17 11:25:54,683 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2023-11-17 11:25:54,683 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 61 transitions, 426 flow [2023-11-17 11:25:54,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.5) internal successors, (123), 6 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-17 11:25:54,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:54,684 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:54,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-17 11:25:54,684 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:54,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash -2006414096, now seen corresponding path program 1 times [2023-11-17 11:25:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359874907] [2023-11-17 11:25:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:54,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:54,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:54,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359874907] [2023-11-17 11:25:54,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359874907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:54,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:54,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:25:54,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285585074] [2023-11-17 11:25:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:54,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:25:54,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:54,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:25:54,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:25:54,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:54,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 61 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-17 11:25:54,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:54,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:54,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:55,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][62], [Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, 100#true, Black: 75#(= ~x~0 0), Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 27#L827true, 112#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, 49#L764true, 28#P0EXITtrue, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:25:55,502 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-11-17 11:25:55,502 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:55,502 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:55,502 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:55,593 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][62], [8#L862true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 100#true, Black: 75#(= ~x~0 0), Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 27#L827true, 112#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, 49#L764true, 28#P0EXITtrue, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:25:55,593 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-17 11:25:55,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:55,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:55,593 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:55,908 INFO L124 PetriNetUnfolderBase]: 7825/11159 cut-off events. [2023-11-17 11:25:55,908 INFO L125 PetriNetUnfolderBase]: For 32289/32982 co-relation queries the response was YES. [2023-11-17 11:25:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41382 conditions, 11159 events. 7825/11159 cut-off events. For 32289/32982 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 62767 event pairs, 1276 based on Foata normal form. 241/10704 useless extension candidates. Maximal degree in co-relation 41360. Up to 8181 conditions per place. [2023-11-17 11:25:55,995 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 62 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2023-11-17 11:25:55,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 87 transitions, 696 flow [2023-11-17 11:25:55,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:25:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:25:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions. [2023-11-17 11:25:55,997 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5214285714285715 [2023-11-17 11:25:55,997 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 146 transitions. [2023-11-17 11:25:55,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 146 transitions. [2023-11-17 11:25:55,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:55,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 146 transitions. [2023-11-17 11:25:55,998 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 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-11-17 11:25:55,998 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:55,999 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:25:55,999 INFO L175 Difference]: Start difference. First operand has 54 places, 61 transitions, 426 flow. Second operand 4 states and 146 transitions. [2023-11-17 11:25:55,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 87 transitions, 696 flow [2023-11-17 11:25:56,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 87 transitions, 689 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:56,024 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 464 flow [2023-11-17 11:25:56,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=464, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2023-11-17 11:25:56,026 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places. [2023-11-17 11:25:56,026 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 464 flow [2023-11-17 11:25:56,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 5 states have internal predecessors, (135), 0 states have call successors, (0), 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-11-17 11:25:56,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:56,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-17 11:25:56,027 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:56,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:56,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1428140907, now seen corresponding path program 1 times [2023-11-17 11:25:56,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382848794] [2023-11-17 11:25:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382848794] [2023-11-17 11:25:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382848794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:56,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492301565] [2023-11-17 11:25:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:56,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:56,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:56,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:56,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:56,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 464 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:25:56,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:56,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:56,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:57,407 INFO L124 PetriNetUnfolderBase]: 9344/13123 cut-off events. [2023-11-17 11:25:57,407 INFO L125 PetriNetUnfolderBase]: For 41094/41954 co-relation queries the response was YES. [2023-11-17 11:25:57,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50739 conditions, 13123 events. 9344/13123 cut-off events. For 41094/41954 co-relation queries the response was YES. Maximal size of possible extension queue 637. Compared 73133 event pairs, 4360 based on Foata normal form. 181/12557 useless extension candidates. Maximal degree in co-relation 50715. Up to 9854 conditions per place. [2023-11-17 11:25:57,490 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 60 selfloop transitions, 27 changer transitions 0/97 dead transitions. [2023-11-17 11:25:57,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 836 flow [2023-11-17 11:25:57,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:25:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:25:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 171 transitions. [2023-11-17 11:25:57,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48857142857142855 [2023-11-17 11:25:57,492 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 171 transitions. [2023-11-17 11:25:57,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 171 transitions. [2023-11-17 11:25:57,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:57,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 171 transitions. [2023-11-17 11:25:57,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 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-11-17 11:25:57,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:25:57,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:25:57,493 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 464 flow. Second operand 5 states and 171 transitions. [2023-11-17 11:25:57,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 836 flow [2023-11-17 11:25:57,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 806 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-17 11:25:57,515 INFO L231 Difference]: Finished difference. Result has 60 places, 76 transitions, 664 flow [2023-11-17 11:25:57,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=664, PETRI_PLACES=60, PETRI_TRANSITIONS=76} [2023-11-17 11:25:57,516 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 18 predicate places. [2023-11-17 11:25:57,516 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 76 transitions, 664 flow [2023-11-17 11:25:57,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:25:57,516 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:57,516 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:57,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-17 11:25:57,517 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:57,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:57,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1695031005, now seen corresponding path program 2 times [2023-11-17 11:25:57,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:57,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56654356] [2023-11-17 11:25:57,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:57,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:57,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:57,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56654356] [2023-11-17 11:25:57,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56654356] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:57,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:57,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:57,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639093909] [2023-11-17 11:25:57,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:57,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:57,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:57,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:57,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:57,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:25:57,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 76 transitions, 664 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:25:57,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:57,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:25:57,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:25:58,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][86], [Black: 128#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, 100#true, Black: 75#(= ~x~0 0), Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 27#L827true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, 49#L764true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 121#(= ~y$r_buff0_thd0~0 0), P2Thread1of1ForFork2InUse]) [2023-11-17 11:25:58,725 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-11-17 11:25:58,725 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:58,725 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:58,725 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:25:59,082 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][86], [Black: 128#(and (= ~y$r_buff0_thd0~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= ~y~0 1)), 8#L862true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 100#true, Black: 75#(= ~x~0 0), Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 27#L827true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, 49#L764true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 121#(= ~y$r_buff0_thd0~0 0), P2Thread1of1ForFork2InUse]) [2023-11-17 11:25:59,083 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-17 11:25:59,083 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:59,083 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:59,083 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:25:59,367 INFO L124 PetriNetUnfolderBase]: 10857/15379 cut-off events. [2023-11-17 11:25:59,367 INFO L125 PetriNetUnfolderBase]: For 68062/69303 co-relation queries the response was YES. [2023-11-17 11:25:59,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67332 conditions, 15379 events. 10857/15379 cut-off events. For 68062/69303 co-relation queries the response was YES. Maximal size of possible extension queue 805. Compared 90661 event pairs, 1288 based on Foata normal form. 476/14922 useless extension candidates. Maximal degree in co-relation 67306. Up to 8594 conditions per place. [2023-11-17 11:25:59,472 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 89 selfloop transitions, 55 changer transitions 0/154 dead transitions. [2023-11-17 11:25:59,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 154 transitions, 1417 flow [2023-11-17 11:25:59,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:25:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:25:59,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 281 transitions. [2023-11-17 11:25:59,474 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5017857142857143 [2023-11-17 11:25:59,474 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 281 transitions. [2023-11-17 11:25:59,474 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 281 transitions. [2023-11-17 11:25:59,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:25:59,474 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 281 transitions. [2023-11-17 11:25:59,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 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-11-17 11:25:59,476 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 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-11-17 11:25:59,476 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 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-11-17 11:25:59,476 INFO L175 Difference]: Start difference. First operand has 60 places, 76 transitions, 664 flow. Second operand 8 states and 281 transitions. [2023-11-17 11:25:59,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 154 transitions, 1417 flow [2023-11-17 11:25:59,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 154 transitions, 1392 flow, removed 12 selfloop flow, removed 1 redundant places. [2023-11-17 11:25:59,530 INFO L231 Difference]: Finished difference. Result has 68 places, 97 transitions, 1017 flow [2023-11-17 11:25:59,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1017, PETRI_PLACES=68, PETRI_TRANSITIONS=97} [2023-11-17 11:25:59,531 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 26 predicate places. [2023-11-17 11:25:59,531 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 97 transitions, 1017 flow [2023-11-17 11:25:59,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:25:59,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:25:59,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:25:59,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-17 11:25:59,532 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:25:59,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:25:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1394154057, now seen corresponding path program 3 times [2023-11-17 11:25:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:25:59,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077991946] [2023-11-17 11:25:59,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:25:59,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:25:59,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:25:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:25:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:25:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077991946] [2023-11-17 11:25:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077991946] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:25:59,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:25:59,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:25:59,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629508308] [2023-11-17 11:25:59,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:25:59,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:25:59,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:25:59,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:25:59,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:25:59,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70 [2023-11-17 11:25:59,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 97 transitions, 1017 flow. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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-11-17 11:25:59,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:25:59,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70 [2023-11-17 11:25:59,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:02,204 INFO L124 PetriNetUnfolderBase]: 15605/21346 cut-off events. [2023-11-17 11:26:02,204 INFO L125 PetriNetUnfolderBase]: For 84393/84393 co-relation queries the response was YES. [2023-11-17 11:26:02,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97420 conditions, 21346 events. 15605/21346 cut-off events. For 84393/84393 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 114348 event pairs, 682 based on Foata normal form. 36/21382 useless extension candidates. Maximal degree in co-relation 97391. Up to 12903 conditions per place. [2023-11-17 11:26:02,420 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 122 selfloop transitions, 102 changer transitions 0/224 dead transitions. [2023-11-17 11:26:02,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 224 transitions, 2306 flow [2023-11-17 11:26:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-17 11:26:02,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-17 11:26:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 270 transitions. [2023-11-17 11:26:02,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48214285714285715 [2023-11-17 11:26:02,422 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 270 transitions. [2023-11-17 11:26:02,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 270 transitions. [2023-11-17 11:26:02,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:02,423 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 270 transitions. [2023-11-17 11:26:02,423 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.75) internal successors, (270), 8 states have internal predecessors, (270), 0 states have call successors, (0), 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-11-17 11:26:02,424 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 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-11-17 11:26:02,424 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 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-11-17 11:26:02,424 INFO L175 Difference]: Start difference. First operand has 68 places, 97 transitions, 1017 flow. Second operand 8 states and 270 transitions. [2023-11-17 11:26:02,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 224 transitions, 2306 flow [2023-11-17 11:26:02,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 224 transitions, 2211 flow, removed 34 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:02,672 INFO L231 Difference]: Finished difference. Result has 78 places, 162 transitions, 2004 flow [2023-11-17 11:26:02,672 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=942, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2004, PETRI_PLACES=78, PETRI_TRANSITIONS=162} [2023-11-17 11:26:02,672 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 36 predicate places. [2023-11-17 11:26:02,672 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 162 transitions, 2004 flow [2023-11-17 11:26:02,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 6 states have internal predecessors, (124), 0 states have call successors, (0), 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-11-17 11:26:02,673 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:02,673 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:02,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-17 11:26:02,673 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:02,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:02,673 INFO L85 PathProgramCache]: Analyzing trace with hash 844017615, now seen corresponding path program 4 times [2023-11-17 11:26:02,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:02,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147926183] [2023-11-17 11:26:02,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:02,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:03,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:03,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147926183] [2023-11-17 11:26:03,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147926183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:03,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:03,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:03,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687369898] [2023-11-17 11:26:03,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:03,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:03,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:03,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:03,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:03,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:26:03,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 162 transitions, 2004 flow. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:26:03,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:03,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:26:03,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:05,016 INFO L124 PetriNetUnfolderBase]: 12581/17943 cut-off events. [2023-11-17 11:26:05,016 INFO L125 PetriNetUnfolderBase]: For 129488/131342 co-relation queries the response was YES. [2023-11-17 11:26:05,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103849 conditions, 17943 events. 12581/17943 cut-off events. For 129488/131342 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 107148 event pairs, 1321 based on Foata normal form. 865/18301 useless extension candidates. Maximal degree in co-relation 103814. Up to 11136 conditions per place. [2023-11-17 11:26:05,221 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 98 selfloop transitions, 71 changer transitions 0/204 dead transitions. [2023-11-17 11:26:05,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 204 transitions, 2654 flow [2023-11-17 11:26:05,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 206 transitions. [2023-11-17 11:26:05,222 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49047619047619045 [2023-11-17 11:26:05,222 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 206 transitions. [2023-11-17 11:26:05,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 206 transitions. [2023-11-17 11:26:05,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:05,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 206 transitions. [2023-11-17 11:26:05,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 34.333333333333336) internal successors, (206), 6 states have internal predecessors, (206), 0 states have call successors, (0), 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-11-17 11:26:05,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:05,224 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:05,224 INFO L175 Difference]: Start difference. First operand has 78 places, 162 transitions, 2004 flow. Second operand 6 states and 206 transitions. [2023-11-17 11:26:05,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 204 transitions, 2654 flow [2023-11-17 11:26:05,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 204 transitions, 2504 flow, removed 60 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:05,605 INFO L231 Difference]: Finished difference. Result has 82 places, 173 transitions, 2235 flow [2023-11-17 11:26:05,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2235, PETRI_PLACES=82, PETRI_TRANSITIONS=173} [2023-11-17 11:26:05,605 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 40 predicate places. [2023-11-17 11:26:05,605 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 173 transitions, 2235 flow [2023-11-17 11:26:05,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 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-11-17 11:26:05,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:05,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:05,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-17 11:26:05,606 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:05,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:05,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1109182066, now seen corresponding path program 1 times [2023-11-17 11:26:05,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:05,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075371670] [2023-11-17 11:26:05,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:05,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:06,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075371670] [2023-11-17 11:26:06,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075371670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:06,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:06,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:06,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571769189] [2023-11-17 11:26:06,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:06,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:06,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:06,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:06,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:06,409 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70 [2023-11-17 11:26:06,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 173 transitions, 2235 flow. Second operand has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-17 11:26:06,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:06,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70 [2023-11-17 11:26:06,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:08,835 INFO L124 PetriNetUnfolderBase]: 16692/22841 cut-off events. [2023-11-17 11:26:08,835 INFO L125 PetriNetUnfolderBase]: For 144545/144545 co-relation queries the response was YES. [2023-11-17 11:26:08,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131009 conditions, 22841 events. 16692/22841 cut-off events. For 144545/144545 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 123233 event pairs, 1220 based on Foata normal form. 40/22881 useless extension candidates. Maximal degree in co-relation 130972. Up to 13279 conditions per place. [2023-11-17 11:26:09,075 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 131 selfloop transitions, 100 changer transitions 0/231 dead transitions. [2023-11-17 11:26:09,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 231 transitions, 3165 flow [2023-11-17 11:26:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:09,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2023-11-17 11:26:09,076 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4828571428571429 [2023-11-17 11:26:09,077 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 169 transitions. [2023-11-17 11:26:09,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 169 transitions. [2023-11-17 11:26:09,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:09,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 169 transitions. [2023-11-17 11:26:09,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 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-11-17 11:26:09,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:09,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:09,078 INFO L175 Difference]: Start difference. First operand has 82 places, 173 transitions, 2235 flow. Second operand 5 states and 169 transitions. [2023-11-17 11:26:09,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 231 transitions, 3165 flow [2023-11-17 11:26:09,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 231 transitions, 3096 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:09,637 INFO L231 Difference]: Finished difference. Result has 84 places, 193 transitions, 2814 flow [2023-11-17 11:26:09,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2166, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2814, PETRI_PLACES=84, PETRI_TRANSITIONS=193} [2023-11-17 11:26:09,638 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 42 predicate places. [2023-11-17 11:26:09,638 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 193 transitions, 2814 flow [2023-11-17 11:26:09,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.428571428571427) internal successors, (143), 7 states have internal predecessors, (143), 0 states have call successors, (0), 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-11-17 11:26:09,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:09,638 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:09,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-17 11:26:09,638 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:09,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1109183926, now seen corresponding path program 2 times [2023-11-17 11:26:09,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:09,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917261717] [2023-11-17 11:26:09,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:09,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:10,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:10,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917261717] [2023-11-17 11:26:10,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917261717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:10,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:10,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:10,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145935621] [2023-11-17 11:26:10,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:10,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:10,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:10,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:10,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:10,025 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:26:10,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 193 transitions, 2814 flow. Second operand has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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-11-17 11:26:10,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:10,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:26:10,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:12,347 INFO L124 PetriNetUnfolderBase]: 13052/18583 cut-off events. [2023-11-17 11:26:12,348 INFO L125 PetriNetUnfolderBase]: For 174360/178183 co-relation queries the response was YES. [2023-11-17 11:26:12,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125354 conditions, 18583 events. 13052/18583 cut-off events. For 174360/178183 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 110770 event pairs, 1458 based on Foata normal form. 1398/19406 useless extension candidates. Maximal degree in co-relation 125316. Up to 9778 conditions per place. [2023-11-17 11:26:12,863 INFO L140 encePairwiseOnDemand]: 62/70 looper letters, 112 selfloop transitions, 72 changer transitions 0/228 dead transitions. [2023-11-17 11:26:12,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 228 transitions, 3408 flow [2023-11-17 11:26:12,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:12,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:12,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2023-11-17 11:26:12,865 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257142857142857 [2023-11-17 11:26:12,865 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 184 transitions. [2023-11-17 11:26:12,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 184 transitions. [2023-11-17 11:26:12,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:12,865 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 184 transitions. [2023-11-17 11:26:12,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 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-11-17 11:26:12,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:12,869 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:12,869 INFO L175 Difference]: Start difference. First operand has 84 places, 193 transitions, 2814 flow. Second operand 5 states and 184 transitions. [2023-11-17 11:26:12,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 228 transitions, 3408 flow [2023-11-17 11:26:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 228 transitions, 3340 flow, removed 19 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:13,370 INFO L231 Difference]: Finished difference. Result has 87 places, 193 transitions, 2959 flow [2023-11-17 11:26:13,370 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2750, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=72, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2959, PETRI_PLACES=87, PETRI_TRANSITIONS=193} [2023-11-17 11:26:13,371 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 45 predicate places. [2023-11-17 11:26:13,371 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 193 transitions, 2959 flow [2023-11-17 11:26:13,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.285714285714285) internal successors, (184), 7 states have internal predecessors, (184), 0 states have call successors, (0), 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-11-17 11:26:13,371 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:13,371 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:13,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-17 11:26:13,385 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:13,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:13,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1533068290, now seen corresponding path program 3 times [2023-11-17 11:26:13,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:13,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864010960] [2023-11-17 11:26:13,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:13,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:13,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:13,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864010960] [2023-11-17 11:26:13,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864010960] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:13,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:13,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:13,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077668099] [2023-11-17 11:26:13,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:13,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:13,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:13,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:13,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:13,580 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2023-11-17 11:26:13,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 193 transitions, 2959 flow. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-17 11:26:13,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:13,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2023-11-17 11:26:13,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:14,714 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][189], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 199#true, 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,715 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][86], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 121#(= ~y$r_buff0_thd0~0 0), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,715 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][326], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 121#(= ~y$r_buff0_thd0~0 0), 188#true, Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 27#L827true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 199#true, 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,715 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,715 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][292], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 121#(= ~y$r_buff0_thd0~0 0), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 27#L827true, 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,716 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][194], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 26#L820true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 199#true, 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,716 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][87], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 121#(= ~y$r_buff0_thd0~0 0), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 26#L820true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,716 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,716 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:14,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([424] L854-->L862: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd0~0_112 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_114 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_209 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse2 (and (not (= (mod v_~y$w_buff0_used~0_210 256) 0)) .cse5)) (.cse1 (and .cse3 (not (= (mod v_~y$w_buff1_used~0_192 256) 0))))) (and (= v_~y$r_buff0_thd0~0_113 (ite .cse0 0 v_~y$r_buff0_thd0~0_114)) (= v_~y$w_buff1_used~0_191 (ite (or .cse1 .cse0) 0 v_~y$w_buff1_used~0_192)) (= v_~y$w_buff0_used~0_209 (ite .cse2 0 v_~y$w_buff0_used~0_210)) (not (= (mod v_~main$tmp_guard0~0_36 256) 0)) (= v_~y~0_143 (ite .cse2 v_~y$w_buff0~0_113 (ite .cse1 v_~y$w_buff1~0_101 v_~y~0_144))) (= v_~y$r_buff1_thd0~0_111 (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_191 256) 0))) (and (not (= (mod v_~y$r_buff0_thd0~0_113 256) 0)) .cse4)) 0 v_~y$r_buff1_thd0~0_112))))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_210, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_114, ~y$w_buff0~0=v_~y$w_buff0~0_113, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ~y~0=v_~y~0_144, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_112, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_192} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_209, ~y$w_buff1~0=v_~y$w_buff1~0_101, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_113, ~y$w_buff0~0=v_~y$w_buff0~0_113, ULTIMATE.start_assume_abort_if_not_~cond#1=|v_ULTIMATE.start_assume_abort_if_not_~cond#1_24|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_36, ~y~0=v_~y~0_143, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_111, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_191, ULTIMATE.start_assume_abort_if_not_#in~cond#1=|v_ULTIMATE.start_assume_abort_if_not_#in~cond#1_16|} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond#1, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0, ULTIMATE.start_assume_abort_if_not_#in~cond#1][196], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 8#L862true, Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 199#true, 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,894 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][86], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), 188#true, Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), P0Thread1of1ForFork3InUse, 35#L767true, 28#P0EXITtrue, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,912 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][292], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), 27#L827true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), P0Thread1of1ForFork3InUse, 35#L767true, 28#P0EXITtrue, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,912 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,912 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][87], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 193#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1))), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), 167#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 188#true, 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 26#L820true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 136#(or (and (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (<= 0 (div ~y$w_buff0_used~0 256))) (and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), P0Thread1of1ForFork3InUse, 28#P0EXITtrue, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:14,913 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:14,913 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:15,494 INFO L124 PetriNetUnfolderBase]: 10169/14740 cut-off events. [2023-11-17 11:26:15,495 INFO L125 PetriNetUnfolderBase]: For 235622/243501 co-relation queries the response was YES. [2023-11-17 11:26:15,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105918 conditions, 14740 events. 10169/14740 cut-off events. For 235622/243501 co-relation queries the response was YES. Maximal size of possible extension queue 894. Compared 91986 event pairs, 932 based on Foata normal form. 5218/19434 useless extension candidates. Maximal degree in co-relation 105878. Up to 7725 conditions per place. [2023-11-17 11:26:15,665 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 311 selfloop transitions, 6 changer transitions 0/365 dead transitions. [2023-11-17 11:26:15,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 365 transitions, 6377 flow [2023-11-17 11:26:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2023-11-17 11:26:15,666 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.475 [2023-11-17 11:26:15,666 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 133 transitions. [2023-11-17 11:26:15,666 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 133 transitions. [2023-11-17 11:26:15,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:15,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 133 transitions. [2023-11-17 11:26:15,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 33.25) internal successors, (133), 4 states have internal predecessors, (133), 0 states have call successors, (0), 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-11-17 11:26:15,668 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:26:15,669 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:26:15,669 INFO L175 Difference]: Start difference. First operand has 87 places, 193 transitions, 2959 flow. Second operand 4 states and 133 transitions. [2023-11-17 11:26:15,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 365 transitions, 6377 flow [2023-11-17 11:26:16,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 365 transitions, 6059 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:16,025 INFO L231 Difference]: Finished difference. Result has 88 places, 197 transitions, 2907 flow [2023-11-17 11:26:16,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2801, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2907, PETRI_PLACES=88, PETRI_TRANSITIONS=197} [2023-11-17 11:26:16,026 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 46 predicate places. [2023-11-17 11:26:16,026 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 197 transitions, 2907 flow [2023-11-17 11:26:16,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 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-11-17 11:26:16,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:16,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:16,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-17 11:26:16,026 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:16,027 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:16,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1783938156, now seen corresponding path program 1 times [2023-11-17 11:26:16,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:16,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33286167] [2023-11-17 11:26:16,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:16,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:16,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:16,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:16,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33286167] [2023-11-17 11:26:16,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33286167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:16,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:16,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:26:16,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457681989] [2023-11-17 11:26:16,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:16,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-17 11:26:16,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:16,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-17 11:26:16,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-17 11:26:16,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70 [2023-11-17 11:26:16,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 197 transitions, 2907 flow. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 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-11-17 11:26:16,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:16,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70 [2023-11-17 11:26:16,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:19,240 INFO L124 PetriNetUnfolderBase]: 15644/22160 cut-off events. [2023-11-17 11:26:19,241 INFO L125 PetriNetUnfolderBase]: For 189029/189029 co-relation queries the response was YES. [2023-11-17 11:26:19,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148717 conditions, 22160 events. 15644/22160 cut-off events. For 189029/189029 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 129142 event pairs, 1319 based on Foata normal form. 46/22206 useless extension candidates. Maximal degree in co-relation 148675. Up to 17602 conditions per place. [2023-11-17 11:26:19,461 INFO L140 encePairwiseOnDemand]: 60/70 looper letters, 249 selfloop transitions, 42 changer transitions 6/297 dead transitions. [2023-11-17 11:26:19,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 297 transitions, 4384 flow [2023-11-17 11:26:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:26:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:26:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-17 11:26:19,463 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45918367346938777 [2023-11-17 11:26:19,463 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-17 11:26:19,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-17 11:26:19,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:19,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-17 11:26:19,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 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-11-17 11:26:19,465 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 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-11-17 11:26:19,465 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 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-11-17 11:26:19,465 INFO L175 Difference]: Start difference. First operand has 88 places, 197 transitions, 2907 flow. Second operand 7 states and 225 transitions. [2023-11-17 11:26:19,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 297 transitions, 4384 flow [2023-11-17 11:26:19,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 297 transitions, 4377 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:19,999 INFO L231 Difference]: Finished difference. Result has 96 places, 210 transitions, 3237 flow [2023-11-17 11:26:19,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2905, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3237, PETRI_PLACES=96, PETRI_TRANSITIONS=210} [2023-11-17 11:26:19,999 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 54 predicate places. [2023-11-17 11:26:19,999 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 210 transitions, 3237 flow [2023-11-17 11:26:20,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 8 states have internal predecessors, (162), 0 states have call successors, (0), 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-11-17 11:26:20,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:20,000 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:20,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-17 11:26:20,000 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:20,000 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:20,000 INFO L85 PathProgramCache]: Analyzing trace with hash -225006878, now seen corresponding path program 2 times [2023-11-17 11:26:20,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:20,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101870062] [2023-11-17 11:26:20,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:20,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:20,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:20,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:20,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101870062] [2023-11-17 11:26:20,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101870062] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:20,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:20,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946733667] [2023-11-17 11:26:20,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:20,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:20,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:20,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:20,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70 [2023-11-17 11:26:20,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 210 transitions, 3237 flow. Second operand has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 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-11-17 11:26:20,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:20,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70 [2023-11-17 11:26:20,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:22,472 INFO L124 PetriNetUnfolderBase]: 9763/14621 cut-off events. [2023-11-17 11:26:22,473 INFO L125 PetriNetUnfolderBase]: For 176019/180920 co-relation queries the response was YES. [2023-11-17 11:26:22,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104782 conditions, 14621 events. 9763/14621 cut-off events. For 176019/180920 co-relation queries the response was YES. Maximal size of possible extension queue 752. Compared 93194 event pairs, 1014 based on Foata normal form. 1484/15585 useless extension candidates. Maximal degree in co-relation 104736. Up to 6729 conditions per place. [2023-11-17 11:26:22,604 INFO L140 encePairwiseOnDemand]: 64/70 looper letters, 138 selfloop transitions, 66 changer transitions 0/248 dead transitions. [2023-11-17 11:26:22,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 248 transitions, 3999 flow [2023-11-17 11:26:22,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:22,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:22,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 172 transitions. [2023-11-17 11:26:22,605 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49142857142857144 [2023-11-17 11:26:22,605 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 172 transitions. [2023-11-17 11:26:22,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 172 transitions. [2023-11-17 11:26:22,605 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:22,605 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 172 transitions. [2023-11-17 11:26:22,606 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 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-11-17 11:26:22,606 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:22,607 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:22,607 INFO L175 Difference]: Start difference. First operand has 96 places, 210 transitions, 3237 flow. Second operand 5 states and 172 transitions. [2023-11-17 11:26:22,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 248 transitions, 3999 flow [2023-11-17 11:26:23,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 248 transitions, 3894 flow, removed 23 selfloop flow, removed 3 redundant places. [2023-11-17 11:26:23,028 INFO L231 Difference]: Finished difference. Result has 98 places, 214 transitions, 3430 flow [2023-11-17 11:26:23,028 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=3147, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=3430, PETRI_PLACES=98, PETRI_TRANSITIONS=214} [2023-11-17 11:26:23,028 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2023-11-17 11:26:23,028 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 214 transitions, 3430 flow [2023-11-17 11:26:23,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 states have internal predecessors, (185), 0 states have call successors, (0), 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-11-17 11:26:23,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:23,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:23,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-17 11:26:23,029 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:23,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -537768257, now seen corresponding path program 1 times [2023-11-17 11:26:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:23,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988551534] [2023-11-17 11:26:23,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:23,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:23,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:23,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:23,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988551534] [2023-11-17 11:26:23,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988551534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:23,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:23,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-17 11:26:23,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103261633] [2023-11-17 11:26:23,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:23,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-17 11:26:23,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:23,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-17 11:26:23,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-17 11:26:23,245 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 70 [2023-11-17 11:26:23,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 214 transitions, 3430 flow. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-17 11:26:23,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:23,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 70 [2023-11-17 11:26:23,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:26,757 INFO L124 PetriNetUnfolderBase]: 16611/24536 cut-off events. [2023-11-17 11:26:26,757 INFO L125 PetriNetUnfolderBase]: For 329181/334748 co-relation queries the response was YES. [2023-11-17 11:26:26,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172472 conditions, 24536 events. 16611/24536 cut-off events. For 329181/334748 co-relation queries the response was YES. Maximal size of possible extension queue 1370. Compared 165357 event pairs, 2946 based on Foata normal form. 3707/27740 useless extension candidates. Maximal degree in co-relation 172426. Up to 11035 conditions per place. [2023-11-17 11:26:27,001 INFO L140 encePairwiseOnDemand]: 66/70 looper letters, 212 selfloop transitions, 13 changer transitions 145/400 dead transitions. [2023-11-17 11:26:27,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 400 transitions, 7372 flow [2023-11-17 11:26:27,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-17 11:26:27,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-17 11:26:27,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2023-11-17 11:26:27,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-11-17 11:26:27,003 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 140 transitions. [2023-11-17 11:26:27,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 140 transitions. [2023-11-17 11:26:27,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:27,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 140 transitions. [2023-11-17 11:26:27,003 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 0 states have call successors, (0), 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-11-17 11:26:27,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:26:27,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 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-11-17 11:26:27,004 INFO L175 Difference]: Start difference. First operand has 98 places, 214 transitions, 3430 flow. Second operand 4 states and 140 transitions. [2023-11-17 11:26:27,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 400 transitions, 7372 flow [2023-11-17 11:26:27,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 400 transitions, 6897 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-11-17 11:26:27,542 INFO L231 Difference]: Finished difference. Result has 98 places, 202 transitions, 3058 flow [2023-11-17 11:26:27,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=3208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=3058, PETRI_PLACES=98, PETRI_TRANSITIONS=202} [2023-11-17 11:26:27,543 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2023-11-17 11:26:27,543 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 202 transitions, 3058 flow [2023-11-17 11:26:27,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 0 states have call successors, (0), 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-11-17 11:26:27,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:27,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:27,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-17 11:26:27,543 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:27,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:27,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1477746459, now seen corresponding path program 2 times [2023-11-17 11:26:27,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383061292] [2023-11-17 11:26:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:27,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:27,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:27,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:27,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383061292] [2023-11-17 11:26:27,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383061292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:27,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:27,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:27,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919698223] [2023-11-17 11:26:27,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:27,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:27,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:27,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:27,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:27,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2023-11-17 11:26:27,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 202 transitions, 3058 flow. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-17 11:26:27,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:27,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2023-11-17 11:26:27,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:28,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][263], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 235#(= ~z~0 1), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), 4#L851-3true, 27#L827true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,560 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][91], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 235#(= ~z~0 1), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,561 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,561 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:28,731 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][90], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 26#L820true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 31#L774true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,731 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-11-17 11:26:28,732 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:28,732 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:28,732 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:28,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][263], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), 27#L827true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,763 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][91], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,763 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,763 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:28,923 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][90], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 238#(and (= ~z~0 1) (= ~__unbuffered_p3_EAX~0 1)), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:28,923 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-17 11:26:28,923 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:28,923 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:28,923 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:29,567 INFO L124 PetriNetUnfolderBase]: 8615/13391 cut-off events. [2023-11-17 11:26:29,567 INFO L125 PetriNetUnfolderBase]: For 255520/265544 co-relation queries the response was YES. [2023-11-17 11:26:29,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89645 conditions, 13391 events. 8615/13391 cut-off events. For 255520/265544 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 92754 event pairs, 591 based on Foata normal form. 5032/17893 useless extension candidates. Maximal degree in co-relation 89599. Up to 5853 conditions per place. [2023-11-17 11:26:29,691 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 296 selfloop transitions, 10 changer transitions 56/409 dead transitions. [2023-11-17 11:26:29,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 409 transitions, 7202 flow [2023-11-17 11:26:29,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-17 11:26:29,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-17 11:26:29,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions. [2023-11-17 11:26:29,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48 [2023-11-17 11:26:29,692 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 168 transitions. [2023-11-17 11:26:29,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions. [2023-11-17 11:26:29,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:29,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions. [2023-11-17 11:26:29,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 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-11-17 11:26:29,694 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:29,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 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-11-17 11:26:29,694 INFO L175 Difference]: Start difference. First operand has 98 places, 202 transitions, 3058 flow. Second operand 5 states and 168 transitions. [2023-11-17 11:26:29,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 409 transitions, 7202 flow [2023-11-17 11:26:29,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 409 transitions, 7114 flow, removed 33 selfloop flow, removed 2 redundant places. [2023-11-17 11:26:29,890 INFO L231 Difference]: Finished difference. Result has 101 places, 172 transitions, 2508 flow [2023-11-17 11:26:29,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2807, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2508, PETRI_PLACES=101, PETRI_TRANSITIONS=172} [2023-11-17 11:26:29,891 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 59 predicate places. [2023-11-17 11:26:29,891 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 172 transitions, 2508 flow [2023-11-17 11:26:29,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 states have internal predecessors, (116), 0 states have call successors, (0), 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-11-17 11:26:29,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:29,891 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-11-17 11:26:29,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-17 11:26:29,892 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:29,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:29,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1703699743, now seen corresponding path program 1 times [2023-11-17 11:26:29,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:29,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078871569] [2023-11-17 11:26:29,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:29,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:30,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:30,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:30,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078871569] [2023-11-17 11:26:30,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078871569] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:30,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:30,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-17 11:26:30,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110162988] [2023-11-17 11:26:30,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:30,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-17 11:26:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-17 11:26:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-17 11:26:30,070 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 70 [2023-11-17 11:26:30,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 172 transitions, 2508 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-11-17 11:26:30,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:30,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 70 [2023-11-17 11:26:30,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:31,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][96], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, 257#(= ~x~0 1), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 14#L817true, 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 31#L774true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:31,151 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][97], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 257#(= ~x~0 1), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 14#L817true, Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:31,152 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,152 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:31,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([401] L820-->L827: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd4~0_26 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd4~0_40 256) 0)))) (let ((.cse1 (and (not (= (mod v_~y$w_buff0_used~0_124 256) 0)) .cse5)) (.cse2 (and (not (= 0 (mod v_~y$w_buff1_used~0_115 256))) .cse4)) (.cse0 (and .cse3 .cse5))) (and (= v_~y$r_buff0_thd4~0_39 (ite .cse0 0 v_~y$r_buff0_thd4~0_40)) (= (ite .cse1 v_~y$w_buff0~0_49 (ite .cse2 v_~y$w_buff1~0_44 v_~y~0_76)) v_~y~0_75) (= v_~y$w_buff0_used~0_123 (ite .cse1 0 v_~y$w_buff0_used~0_124)) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd4~0_39 256) 0))) (and (not (= (mod v_~y$w_buff1_used~0_114 256) 0)) .cse4)) 0 v_~y$r_buff1_thd4~0_26) v_~y$r_buff1_thd4~0_25) (= v_~y$w_buff1_used~0_114 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_115))))) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_40, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_26, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_76, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_115} OutVars{~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_39, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_25, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_44, ~y$w_buff0~0=v_~y$w_buff0~0_49, ~y~0=v_~y~0_75, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_114} AuxVars[] AssignedVars[~y$r_buff0_thd4~0, ~y$r_buff1_thd4~0, ~y$w_buff0_used~0, ~y~0, ~y$w_buff1_used~0][225], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, 257#(= ~x~0 1), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 27#L827true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:31,414 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,414 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,414 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,414 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,414 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][97], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 257#(= ~x~0 1), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, 235#(= ~z~0 1), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P3Thread1of1ForFork0InUse, 176#true, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:31,415 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,415 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,415 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,415 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:31,792 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][96], [Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, 257#(= ~x~0 1), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 96#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), 26#L820true, 235#(= ~z~0 1), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), P0Thread1of1ForFork3InUse, 28#P0EXITtrue, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:31,792 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-17 11:26:31,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:31,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:31,792 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:32,619 INFO L124 PetriNetUnfolderBase]: 12446/19805 cut-off events. [2023-11-17 11:26:32,619 INFO L125 PetriNetUnfolderBase]: For 282848/288414 co-relation queries the response was YES. [2023-11-17 11:26:32,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142180 conditions, 19805 events. 12446/19805 cut-off events. For 282848/288414 co-relation queries the response was YES. Maximal size of possible extension queue 1141. Compared 145967 event pairs, 2921 based on Foata normal form. 2168/21146 useless extension candidates. Maximal degree in co-relation 142132. Up to 9211 conditions per place. [2023-11-17 11:26:32,760 INFO L140 encePairwiseOnDemand]: 67/70 looper letters, 139 selfloop transitions, 14 changer transitions 86/267 dead transitions. [2023-11-17 11:26:32,760 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 267 transitions, 4452 flow [2023-11-17 11:26:32,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-17 11:26:32,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-17 11:26:32,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2023-11-17 11:26:32,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5285714285714286 [2023-11-17 11:26:32,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 111 transitions. [2023-11-17 11:26:32,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 111 transitions. [2023-11-17 11:26:32,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:32,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 111 transitions. [2023-11-17 11:26:32,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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-11-17 11:26:32,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:26:32,763 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 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-11-17 11:26:32,763 INFO L175 Difference]: Start difference. First operand has 101 places, 172 transitions, 2508 flow. Second operand 3 states and 111 transitions. [2023-11-17 11:26:32,763 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 267 transitions, 4452 flow [2023-11-17 11:26:33,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 267 transitions, 4294 flow, removed 48 selfloop flow, removed 6 redundant places. [2023-11-17 11:26:33,096 INFO L231 Difference]: Finished difference. Result has 98 places, 143 transitions, 1989 flow [2023-11-17 11:26:33,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2423, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1989, PETRI_PLACES=98, PETRI_TRANSITIONS=143} [2023-11-17 11:26:33,097 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 56 predicate places. [2023-11-17 11:26:33,097 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 143 transitions, 1989 flow [2023-11-17 11:26:33,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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-11-17 11:26:33,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:33,097 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] [2023-11-17 11:26:33,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-17 11:26:33,097 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:33,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:33,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1209430661, now seen corresponding path program 1 times [2023-11-17 11:26:33,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:33,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762103206] [2023-11-17 11:26:33,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:33,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:33,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:33,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:33,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:33,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762103206] [2023-11-17 11:26:33,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762103206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:33,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:33,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-17 11:26:33,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901673336] [2023-11-17 11:26:33,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:33,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-17 11:26:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-17 11:26:33,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-17 11:26:33,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2023-11-17 11:26:33,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 143 transitions, 1989 flow. Second operand has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-11-17 11:26:33,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:33,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2023-11-17 11:26:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:34,077 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][81], [42#L804true, Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 257#(= ~x~0 1), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 235#(= ~z~0 1), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 269#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 255#true, 28#P0EXITtrue, P0Thread1of1ForFork3InUse, 35#L767true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:34,077 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-17 11:26:34,077 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:34,077 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:34,077 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-17 11:26:34,248 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][80], [Black: 257#(= ~x~0 1), Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), 202#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 26#L820true, 235#(= ~z~0 1), 269#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 4#L851-3true, Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 255#true, P0Thread1of1ForFork3InUse, 28#P0EXITtrue, 31#L774true, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:34,248 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event [2023-11-17 11:26:34,249 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:34,249 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:34,249 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is not cut-off event [2023-11-17 11:26:34,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([394] L797-->L804: Formula: (let ((.cse3 (not (= (mod v_~y$r_buff1_thd3~0_20 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd3~0_41 256) 0))) (.cse4 (not (= (mod v_~y$w_buff0_used~0_99 256) 0)))) (let ((.cse0 (and .cse5 .cse4)) (.cse1 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_100 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) .cse3))) (and (= (ite .cse0 0 v_~y$r_buff0_thd3~0_41) v_~y$r_buff0_thd3~0_40) (= (ite .cse1 0 v_~y$w_buff0_used~0_100) v_~y$w_buff0_used~0_99) (= v_~y$w_buff1_used~0_88 (ite (or .cse2 .cse0) 0 v_~y$w_buff1_used~0_89)) (= (ite (or (and .cse3 (not (= (mod v_~y$w_buff1_used~0_88 256) 0))) (and (not (= (mod v_~y$r_buff0_thd3~0_40 256) 0)) .cse4)) 0 v_~y$r_buff1_thd3~0_20) v_~y$r_buff1_thd3~0_19) (= (ite .cse1 v_~y$w_buff0~0_39 (ite .cse2 v_~y$w_buff1~0_34 v_~y~0_54)) v_~y~0_53)))) InVars {~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_20, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_100, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_41, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_54, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_19, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff1~0=v_~y$w_buff1~0_34, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_40, ~y$w_buff0~0=v_~y$w_buff0~0_39, ~y~0=v_~y~0_53, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_88} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, ~y$w_buff0_used~0, ~y$r_buff0_thd3~0, ~y~0, ~y$w_buff1_used~0][81], [42#L804true, Black: 257#(= ~x~0 1), Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 225#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), 147#true, Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 235#(= ~z~0 1), Black: 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), 269#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 255#true, 28#P0EXITtrue, 35#L767true, P0Thread1of1ForFork3InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), P1Thread1of1ForFork1InUse, 176#true, P3Thread1of1ForFork0InUse, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:34,267 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-17 11:26:34,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:34,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:34,267 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-17 11:26:34,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([387] L767-->L774: Formula: (let ((.cse3 (not (= (mod v_~y$w_buff0_used~0_151 256) 0))) (.cse4 (not (= (mod v_~y$r_buff1_thd2~0_34 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd2~0_38 256) 0)))) (let ((.cse0 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_152 256) 0)))) (.cse2 (and (not (= (mod v_~y$w_buff1_used~0_139 256) 0)) .cse4)) (.cse1 (and .cse5 .cse3))) (and (= v_~y$w_buff0_used~0_151 (ite .cse0 0 v_~y$w_buff0_used~0_152)) (= v_~y$w_buff1_used~0_138 (ite (or .cse1 .cse2) 0 v_~y$w_buff1_used~0_139)) (= v_~y~0_91 (ite .cse0 v_~y$w_buff0~0_67 (ite .cse2 v_~y$w_buff1~0_60 v_~y~0_92))) (= (ite (or (and .cse3 (not (= (mod v_~y$r_buff0_thd2~0_37 256) 0))) (and .cse4 (not (= (mod v_~y$w_buff1_used~0_138 256) 0)))) 0 v_~y$r_buff1_thd2~0_34) v_~y$r_buff1_thd2~0_33) (= v_~y$r_buff0_thd2~0_37 (ite .cse1 0 v_~y$r_buff0_thd2~0_38))))) InVars {~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_152, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_38, ~y~0=v_~y~0_92, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_139} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_33, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_151, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_67, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_37, ~y~0=v_~y~0_91, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_138} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$w_buff0_used~0, ~y$r_buff0_thd2~0, ~y~0, ~y$w_buff1_used~0][80], [Black: 257#(= ~x~0 1), Black: 126#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 251#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1) (<= 0 ~main$tmp_guard0~0)), Black: 70#(= ~__unbuffered_p3_EAX~0 0), 47#L854true, Black: 75#(= ~x~0 0), Black: 204#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 143#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0) (= ~y~0 1)), Black: 135#(and (= ~y$w_buff1~0 0) (<= 1 ~y$w_buff0_used~0) (= ~y$r_buff0_thd0~0 0) (<= (div ~y$w_buff0_used~0 256) 0)), Black: 80#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 147#true, 15#L797true, Black: 215#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff1_thd0~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 90#(and (= ~y$w_buff1~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), Black: 217#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (= ~y$w_buff0~0 0) (= ~y$r_buff1_thd0~0 0)), 226#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= 2 ~y$w_buff0~0)), Black: 212#(and (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff0_thd2~0 0) (not (= 2 ~y~0)) (not (= 2 ~y$w_buff1~0)) (= 2 ~y$w_buff0~0) (= ~y$r_buff1_thd0~0 0)), 121#(= ~y$r_buff0_thd0~0 0), Black: 154#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 156#(and (= ~y$r_buff0_thd0~0 0) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (= ~y~0 1)), Black: 149#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff1_used~0 0)), Black: 151#(and (= ~y$r_buff0_thd0~0 0) (= ~y~0 1)), 26#L820true, Black: 152#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 235#(= ~z~0 1), 269#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= ~__unbuffered_cnt~0 1)), 100#true, Black: 104#(and (= ~y$w_buff1~0 0) (<= 0 (div ~y$r_buff0_thd0~0 256)) (= ~y~0 0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)), Black: 168#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 105#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), Black: 116#(and (= ~y$w_buff1~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$w_buff0~0 0)), 255#true, P0Thread1of1ForFork3InUse, 28#P0EXITtrue, 31#L774true, P1Thread1of1ForFork1InUse, Black: 182#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (and (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= 2 ~y$w_buff1~0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (and (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)))), 176#true, P3Thread1of1ForFork0InUse, Black: 247#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P2Thread1of1ForFork2InUse]) [2023-11-17 11:26:34,445 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is not cut-off event [2023-11-17 11:26:34,445 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:34,445 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:34,445 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is not cut-off event [2023-11-17 11:26:35,219 INFO L124 PetriNetUnfolderBase]: 9396/14931 cut-off events. [2023-11-17 11:26:35,219 INFO L125 PetriNetUnfolderBase]: For 235294/244003 co-relation queries the response was YES. [2023-11-17 11:26:35,335 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98947 conditions, 14931 events. 9396/14931 cut-off events. For 235294/244003 co-relation queries the response was YES. Maximal size of possible extension queue 1040. Compared 109628 event pairs, 654 based on Foata normal form. 3521/17804 useless extension candidates. Maximal degree in co-relation 98900. Up to 5902 conditions per place. [2023-11-17 11:26:35,365 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 222 selfloop transitions, 14 changer transitions 56/326 dead transitions. [2023-11-17 11:26:35,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 326 transitions, 5345 flow [2023-11-17 11:26:35,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:35,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:35,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 202 transitions. [2023-11-17 11:26:35,366 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48095238095238096 [2023-11-17 11:26:35,367 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 202 transitions. [2023-11-17 11:26:35,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 202 transitions. [2023-11-17 11:26:35,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:35,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 202 transitions. [2023-11-17 11:26:35,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.666666666666664) internal successors, (202), 6 states have internal predecessors, (202), 0 states have call successors, (0), 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-11-17 11:26:35,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:35,375 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:35,375 INFO L175 Difference]: Start difference. First operand has 98 places, 143 transitions, 1989 flow. Second operand 6 states and 202 transitions. [2023-11-17 11:26:35,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 326 transitions, 5345 flow [2023-11-17 11:26:35,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 326 transitions, 5241 flow, removed 37 selfloop flow, removed 1 redundant places. [2023-11-17 11:26:35,534 INFO L231 Difference]: Finished difference. Result has 104 places, 137 transitions, 1863 flow [2023-11-17 11:26:35,535 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1925, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1863, PETRI_PLACES=104, PETRI_TRANSITIONS=137} [2023-11-17 11:26:35,535 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 62 predicate places. [2023-11-17 11:26:35,535 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 137 transitions, 1863 flow [2023-11-17 11:26:35,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.0) internal successors, (138), 6 states have internal predecessors, (138), 0 states have call successors, (0), 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-11-17 11:26:35,535 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:35,535 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-11-17 11:26:35,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-17 11:26:35,535 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:35,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:35,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1807022248, now seen corresponding path program 1 times [2023-11-17 11:26:35,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:35,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263281685] [2023-11-17 11:26:35,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:35,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:35,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:35,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:35,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:35,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263281685] [2023-11-17 11:26:35,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263281685] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:35,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:35,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-17 11:26:35,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686333731] [2023-11-17 11:26:35,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:35,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-17 11:26:35,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:35,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-17 11:26:35,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-17 11:26:35,905 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 70 [2023-11-17 11:26:35,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 137 transitions, 1863 flow. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-17 11:26:35,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:35,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 70 [2023-11-17 11:26:35,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:39,718 INFO L124 PetriNetUnfolderBase]: 18166/28722 cut-off events. [2023-11-17 11:26:39,718 INFO L125 PetriNetUnfolderBase]: For 311300/311300 co-relation queries the response was YES. [2023-11-17 11:26:39,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193463 conditions, 28722 events. 18166/28722 cut-off events. For 311300/311300 co-relation queries the response was YES. Maximal size of possible extension queue 1437. Compared 215212 event pairs, 2305 based on Foata normal form. 11/28733 useless extension candidates. Maximal degree in co-relation 193413. Up to 11745 conditions per place. [2023-11-17 11:26:40,006 INFO L140 encePairwiseOnDemand]: 56/70 looper letters, 158 selfloop transitions, 63 changer transitions 165/386 dead transitions. [2023-11-17 11:26:40,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 386 transitions, 5919 flow [2023-11-17 11:26:40,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-17 11:26:40,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-17 11:26:40,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 203 transitions. [2023-11-17 11:26:40,009 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-11-17 11:26:40,009 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 203 transitions. [2023-11-17 11:26:40,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 203 transitions. [2023-11-17 11:26:40,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:40,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 203 transitions. [2023-11-17 11:26:40,023 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.833333333333336) internal successors, (203), 6 states have internal predecessors, (203), 0 states have call successors, (0), 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-11-17 11:26:40,024 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:40,024 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 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-11-17 11:26:40,024 INFO L175 Difference]: Start difference. First operand has 104 places, 137 transitions, 1863 flow. Second operand 6 states and 203 transitions. [2023-11-17 11:26:40,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 386 transitions, 5919 flow [2023-11-17 11:26:41,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 386 transitions, 5725 flow, removed 30 selfloop flow, removed 4 redundant places. [2023-11-17 11:26:41,363 INFO L231 Difference]: Finished difference. Result has 109 places, 140 transitions, 2209 flow [2023-11-17 11:26:41,363 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=1808, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2209, PETRI_PLACES=109, PETRI_TRANSITIONS=140} [2023-11-17 11:26:41,364 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 67 predicate places. [2023-11-17 11:26:41,365 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 140 transitions, 2209 flow [2023-11-17 11:26:41,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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-11-17 11:26:41,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:41,365 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-11-17 11:26:41,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-17 11:26:41,370 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:41,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:41,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1626307774, now seen corresponding path program 1 times [2023-11-17 11:26:41,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:41,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161058457] [2023-11-17 11:26:41,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:41,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-17 11:26:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-17 11:26:41,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-17 11:26:41,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161058457] [2023-11-17 11:26:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161058457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-17 11:26:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-17 11:26:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-17 11:26:41,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505049317] [2023-11-17 11:26:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-17 11:26:41,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-17 11:26:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-17 11:26:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-17 11:26:41,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-17 11:26:41,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70 [2023-11-17 11:26:41,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 140 transitions, 2209 flow. Second operand has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-11-17 11:26:41,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-17 11:26:41,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70 [2023-11-17 11:26:41,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-17 11:26:42,660 INFO L124 PetriNetUnfolderBase]: 4842/8245 cut-off events. [2023-11-17 11:26:42,660 INFO L125 PetriNetUnfolderBase]: For 109464/110936 co-relation queries the response was YES. [2023-11-17 11:26:42,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57334 conditions, 8245 events. 4842/8245 cut-off events. For 109464/110936 co-relation queries the response was YES. Maximal size of possible extension queue 564. Compared 60480 event pairs, 311 based on Foata normal form. 1071/9102 useless extension candidates. Maximal degree in co-relation 57280. Up to 2819 conditions per place. [2023-11-17 11:26:42,708 INFO L140 encePairwiseOnDemand]: 63/70 looper letters, 69 selfloop transitions, 18 changer transitions 195/289 dead transitions. [2023-11-17 11:26:42,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 289 transitions, 5220 flow [2023-11-17 11:26:42,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-17 11:26:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-17 11:26:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 210 transitions. [2023-11-17 11:26:42,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2023-11-17 11:26:42,709 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 210 transitions. [2023-11-17 11:26:42,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 210 transitions. [2023-11-17 11:26:42,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-17 11:26:42,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 210 transitions. [2023-11-17 11:26:42,710 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.0) internal successors, (210), 7 states have internal predecessors, (210), 0 states have call successors, (0), 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-11-17 11:26:42,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 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-11-17 11:26:42,710 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 70.0) internal successors, (560), 8 states have internal predecessors, (560), 0 states have call successors, (0), 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-11-17 11:26:42,710 INFO L175 Difference]: Start difference. First operand has 109 places, 140 transitions, 2209 flow. Second operand 7 states and 210 transitions. [2023-11-17 11:26:42,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 289 transitions, 5220 flow [2023-11-17 11:26:43,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 289 transitions, 5023 flow, removed 40 selfloop flow, removed 9 redundant places. [2023-11-17 11:26:43,445 INFO L231 Difference]: Finished difference. Result has 108 places, 57 transitions, 689 flow [2023-11-17 11:26:43,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=689, PETRI_PLACES=108, PETRI_TRANSITIONS=57} [2023-11-17 11:26:43,445 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 66 predicate places. [2023-11-17 11:26:43,445 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 57 transitions, 689 flow [2023-11-17 11:26:43,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.857142857142858) internal successors, (160), 7 states have internal predecessors, (160), 0 states have call successors, (0), 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-11-17 11:26:43,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-17 11:26:43,446 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] [2023-11-17 11:26:43,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-17 11:26:43,446 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-17 11:26:43,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-17 11:26:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1443667900, now seen corresponding path program 1 times [2023-11-17 11:26:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-17 11:26:43,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566662378] [2023-11-17 11:26:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-17 11:26:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-17 11:26:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:43,467 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-17 11:26:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-17 11:26:43,525 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-17 11:26:43,526 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-17 11:26:43,526 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-17 11:26:43,527 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-17 11:26:43,528 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-17 11:26:43,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-17 11:26:43,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-17 11:26:43,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-17 11:26:43,529 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-17 11:26:43,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-17 11:26:43,529 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-17 11:26:43,533 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-17 11:26:43,533 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-17 11:26:43,572 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-17 11:26:43,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-17 11:26:43,573 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-17 11:26:43,576 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-17 11:26:43,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:26:43 BasicIcfg [2023-11-17 11:26:43,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-17 11:26:43,614 INFO L158 Benchmark]: Toolchain (without parser) took 57973.61ms. Allocated memory was 254.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 203.9MB in the beginning and 3.4GB in the end (delta: -3.2GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-11-17 11:26:43,614 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 196.1MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-11-17 11:26:43,614 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.45ms. Allocated memory is still 254.8MB. Free memory was 203.6MB in the beginning and 179.8MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:43,614 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.48ms. Allocated memory is still 254.8MB. Free memory was 179.8MB in the beginning and 176.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:43,615 INFO L158 Benchmark]: Boogie Preprocessor took 39.88ms. Allocated memory is still 254.8MB. Free memory was 176.9MB in the beginning and 175.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-17 11:26:43,615 INFO L158 Benchmark]: RCFGBuilder took 569.98ms. Allocated memory is still 254.8MB. Free memory was 174.8MB in the beginning and 180.5MB in the end (delta: -5.7MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2023-11-17 11:26:43,615 INFO L158 Benchmark]: TraceAbstraction took 56853.61ms. Allocated memory was 254.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 179.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. [2023-11-17 11:26:43,616 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.14ms. Allocated memory is still 196.1MB. Free memory is still 148.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 434.45ms. Allocated memory is still 254.8MB. Free memory was 203.6MB in the beginning and 179.8MB in the end (delta: 23.8MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.48ms. Allocated memory is still 254.8MB. Free memory was 179.8MB in the beginning and 176.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.88ms. Allocated memory is still 254.8MB. Free memory was 176.9MB in the beginning and 175.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 569.98ms. Allocated memory is still 254.8MB. Free memory was 174.8MB in the beginning and 180.5MB in the end (delta: -5.7MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * TraceAbstraction took 56853.61ms. Allocated memory was 254.8MB in the beginning and 5.6GB in the end (delta: 5.4GB). Free memory was 179.5MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 2.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.3s, 57 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 29 TransitionsAfterwards, 1226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 21 TotalNumberOfCompositions, 3129 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1280, independent: 1170, independent conditional: 0, independent unconditional: 1170, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 758, independent: 714, independent conditional: 0, independent unconditional: 714, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 758, independent: 706, independent conditional: 0, independent unconditional: 706, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 8, independent conditional: 0, independent unconditional: 8, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 166, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1280, independent: 456, independent conditional: 0, independent unconditional: 456, dependent: 66, dependent conditional: 0, dependent unconditional: 66, unknown: 758, unknown conditional: 0, unknown unconditional: 758] , Statistics on independence cache: Total cache size (in pairs): 171, Positive cache size: 149, Positive conditional cache size: 0, Positive unconditional cache size: 149, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t805; [L845] FCALL, FORK 0 pthread_create(&t805, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t805={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L846] 0 pthread_t t806; [L847] FCALL, FORK 0 pthread_create(&t806, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, t805={5:0}, t806={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t807; [L849] FCALL, FORK 0 pthread_create(&t807, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, t805={5:0}, t806={6:0}, t807={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L787] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L787] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L850] 0 pthread_t t808; [L851] FCALL, FORK 0 pthread_create(&t808, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L769] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_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=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L855] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L855] RET 0 assume_abort_if_not(main$tmp_guard0) [L857] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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, t805={5:0}, t806={6:0}, t807={7:0}, t808={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L869] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L870] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L871] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L872] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L873] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L874] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L879] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 56.7s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 47.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1032 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1032 mSDsluCounter, 159 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2280 IncrementalHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 66 mSDtfsCounter, 2280 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3430occurred in iteration=17, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 359 ConstructedInterpolants, 0 QuantifiedInterpolants, 3385 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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-11-17 11:26:43,634 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...