/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m [2023-11-10 11:42:48,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-10 11:42:48,731 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-NoLbe.epf [2023-11-10 11:42:48,760 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-10 11:42:48,762 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-10 11:42:48,763 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-10 11:42:48,763 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-10 11:42:48,763 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-10 11:42:48,764 INFO L153 SettingsManager]: * Use SBE=true [2023-11-10 11:42:48,767 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-10 11:42:48,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-10 11:42:48,768 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-10 11:42:48,769 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-10 11:42:48,770 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-10 11:42:48,770 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-10 11:42:48,770 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-10 11:42:48,770 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-10 11:42:48,771 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-10 11:42:48,771 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-10 11:42:48,771 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-10 11:42:48,771 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-10 11:42:48,772 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-10 11:42:48,772 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-10 11:42:48,773 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-10 11:42:48,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-10 11:42:48,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:42:48,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-10 11:42:48,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-10 11:42:48,775 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-10 11:42:48,775 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-10 11:42:48,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-10 11:42:48,776 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-10 11:42:48,776 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-10 11:42:48,776 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 [2023-11-10 11:42:49,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-10 11:42:49,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-10 11:42:49,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-10 11:42:49,053 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-10 11:42:49,054 INFO L274 PluginConnector]: CDTParser initialized [2023-11-10 11:42:49,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:42:50,172 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-10 11:42:50,400 INFO L384 CDTParser]: Found 1 translation units. [2023-11-10 11:42:50,401 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:42:50,422 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c514ad08/03ece54dbbb348d68477a9b486b54e31/FLAG8ffcd4962 [2023-11-10 11:42:50,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2c514ad08/03ece54dbbb348d68477a9b486b54e31 [2023-11-10 11:42:50,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-10 11:42:50,448 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-10 11:42:50,451 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-10 11:42:50,451 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-10 11:42:50,455 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-10 11:42:50,455 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:50,456 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3100595d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50, skipping insertion in model container [2023-11-10 11:42:50,456 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:50,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-10 11:42:50,645 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:42:50,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:42:50,856 INFO L202 MainTranslator]: Completed pre-run [2023-11-10 11:42:50,871 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/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-11-10 11:42:50,916 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-10 11:42:50,954 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:42:50,954 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-10 11:42:50,960 INFO L206 MainTranslator]: Completed translation [2023-11-10 11:42:50,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50 WrapperNode [2023-11-10 11:42:50,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-10 11:42:50,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-10 11:42:50,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-10 11:42:50,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-10 11:42:50,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:50,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,009 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-11-10 11:42:51,010 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-10 11:42:51,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-10 11:42:51,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-10 11:42:51,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-10 11:42:51,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,020 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,034 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,037 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,038 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-10 11:42:51,042 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-10 11:42:51,042 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-10 11:42:51,042 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-10 11:42:51,043 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (1/1) ... [2023-11-10 11:42:51,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-10 11:42:51,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-10 11:42:51,071 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-10 11:42:51,086 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-10 11:42:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-10 11:42:51,108 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-10 11:42:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-10 11:42:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-10 11:42:51,109 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-10 11:42:51,109 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-10 11:42:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-10 11:42:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-10 11:42:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-10 11:42:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-10 11:42:51,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-10 11:42:51,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-10 11:42:51,111 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-10 11:42:51,241 INFO L236 CfgBuilder]: Building ICFG [2023-11-10 11:42:51,243 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-10 11:42:51,554 INFO L277 CfgBuilder]: Performing block encoding [2023-11-10 11:42:51,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-10 11:42:51,689 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-10 11:42:51,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:42:51 BoogieIcfgContainer [2023-11-10 11:42:51,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-10 11:42:51,696 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-10 11:42:51,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-10 11:42:51,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-10 11:42:51,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:42:50" (1/3) ... [2023-11-10 11:42:51,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b621f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:42:51, skipping insertion in model container [2023-11-10 11:42:51,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:42:50" (2/3) ... [2023-11-10 11:42:51,702 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b621f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:42:51, skipping insertion in model container [2023-11-10 11:42:51,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:42:51" (3/3) ... [2023-11-10 11:42:51,703 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2023-11-10 11:42:51,720 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-10 11:42:51,721 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-11-10 11:42:51,721 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-10 11:42:51,803 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-10 11:42:51,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 136 transitions, 288 flow [2023-11-10 11:42:51,919 INFO L124 PetriNetUnfolderBase]: 3/132 cut-off events. [2023-11-10 11:42:51,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:42:51,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 3/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-10 11:42:51,926 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 136 transitions, 288 flow [2023-11-10 11:42:51,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 132 transitions, 276 flow [2023-11-10 11:42:51,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-10 11:42:51,944 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;@2c353a4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-10 11:42:51,944 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-11-10 11:42:51,955 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-10 11:42:51,955 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2023-11-10 11:42:51,955 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-10 11:42:51,955 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:42:51,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:42:51,957 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:42:51,961 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:42:51,961 INFO L85 PathProgramCache]: Analyzing trace with hash -26335242, now seen corresponding path program 1 times [2023-11-10 11:42:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:42:51,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674451899] [2023-11-10 11:42:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:42:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:42:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:42:52,453 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-10 11:42:52,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:42:52,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674451899] [2023-11-10 11:42:52,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674451899] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:42:52,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:42:52,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-10 11:42:52,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521389523] [2023-11-10 11:42:52,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:42:52,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-10 11:42:52,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:42:52,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-10 11:42:52,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-10 11:42:52,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 136 [2023-11-10 11:42:52,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-10 11:42:52,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:42:52,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 136 [2023-11-10 11:42:52,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:42:52,784 INFO L124 PetriNetUnfolderBase]: 162/673 cut-off events. [2023-11-10 11:42:52,785 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-10 11:42:52,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 979 conditions, 673 events. 162/673 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3844 event pairs, 102 based on Foata normal form. 46/670 useless extension candidates. Maximal degree in co-relation 925. Up to 191 conditions per place. [2023-11-10 11:42:52,801 INFO L140 encePairwiseOnDemand]: 130/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2023-11-10 11:42:52,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 135 transitions, 331 flow [2023-11-10 11:42:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-10 11:42:52,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-10 11:42:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2023-11-10 11:42:52,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.9387254901960784 [2023-11-10 11:42:52,820 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2023-11-10 11:42:52,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2023-11-10 11:42:52,824 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:42:52,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2023-11-10 11:42:52,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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-10 11:42:52,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-10 11:42:52,838 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 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-10 11:42:52,840 INFO L175 Difference]: Start difference. First operand has 142 places, 132 transitions, 276 flow. Second operand 3 states and 383 transitions. [2023-11-10 11:42:52,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 135 transitions, 331 flow [2023-11-10 11:42:52,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 135 transitions, 324 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-10 11:42:52,849 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 266 flow [2023-11-10 11:42:52,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2023-11-10 11:42:52,857 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -4 predicate places. [2023-11-10 11:42:52,857 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 266 flow [2023-11-10 11:42:52,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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-10 11:42:52,858 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:42:52,858 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:42:52,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-10 11:42:52,859 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:42:52,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:42:52,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1393245938, now seen corresponding path program 1 times [2023-11-10 11:42:52,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:42:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462343579] [2023-11-10 11:42:52,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:42:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:42:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:42:53,254 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-10 11:42:53,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:42:53,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462343579] [2023-11-10 11:42:53,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462343579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:42:53,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:42:53,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:42:53,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652116965] [2023-11-10 11:42:53,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:42:53,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:42:53,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:42:53,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:42:53,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:42:53,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 136 [2023-11-10 11:42:53,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 266 flow. Second operand has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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-10 11:42:53,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:42:53,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 136 [2023-11-10 11:42:53,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:42:54,608 INFO L124 PetriNetUnfolderBase]: 2915/5708 cut-off events. [2023-11-10 11:42:54,608 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2023-11-10 11:42:54,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10289 conditions, 5708 events. 2915/5708 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 44168 event pairs, 733 based on Foata normal form. 0/5539 useless extension candidates. Maximal degree in co-relation 10236. Up to 2328 conditions per place. [2023-11-10 11:42:54,643 INFO L140 encePairwiseOnDemand]: 127/136 looper letters, 24 selfloop transitions, 3 changer transitions 67/186 dead transitions. [2023-11-10 11:42:54,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 186 transitions, 564 flow [2023-11-10 11:42:54,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:42:54,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:42:54,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1056 transitions. [2023-11-10 11:42:54,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8627450980392157 [2023-11-10 11:42:54,647 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1056 transitions. [2023-11-10 11:42:54,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1056 transitions. [2023-11-10 11:42:54,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:42:54,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1056 transitions. [2023-11-10 11:42:54,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 117.33333333333333) internal successors, (1056), 9 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-10 11:42:54,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-10 11:42:54,655 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-10 11:42:54,655 INFO L175 Difference]: Start difference. First operand has 138 places, 127 transitions, 266 flow. Second operand 9 states and 1056 transitions. [2023-11-10 11:42:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 186 transitions, 564 flow [2023-11-10 11:42:54,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 186 transitions, 546 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-10 11:42:54,663 INFO L231 Difference]: Finished difference. Result has 151 places, 114 transitions, 275 flow [2023-11-10 11:42:54,664 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=275, PETRI_PLACES=151, PETRI_TRANSITIONS=114} [2023-11-10 11:42:54,664 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 9 predicate places. [2023-11-10 11:42:54,665 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 114 transitions, 275 flow [2023-11-10 11:42:54,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 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-10 11:42:54,665 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:42:54,665 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:42:54,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-10 11:42:54,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:42:54,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:42:54,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1081729427, now seen corresponding path program 1 times [2023-11-10 11:42:54,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:42:54,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44871109] [2023-11-10 11:42:54,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:42:54,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:42:54,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:42:54,949 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-10 11:42:54,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:42:54,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44871109] [2023-11-10 11:42:54,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44871109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:42:54,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:42:54,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:42:54,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545457572] [2023-11-10 11:42:54,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:42:54,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:42:54,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:42:54,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:42:54,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:42:54,962 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 136 [2023-11-10 11:42:54,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 114 transitions, 275 flow. Second operand has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 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-10 11:42:54,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:42:54,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 136 [2023-11-10 11:42:54,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:42:58,117 INFO L124 PetriNetUnfolderBase]: 11050/18191 cut-off events. [2023-11-10 11:42:58,118 INFO L125 PetriNetUnfolderBase]: For 15306/15306 co-relation queries the response was YES. [2023-11-10 11:42:58,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43808 conditions, 18191 events. 11050/18191 cut-off events. For 15306/15306 co-relation queries the response was YES. Maximal size of possible extension queue 960. Compared 138299 event pairs, 1836 based on Foata normal form. 390/18200 useless extension candidates. Maximal degree in co-relation 43744. Up to 5650 conditions per place. [2023-11-10 11:42:58,277 INFO L140 encePairwiseOnDemand]: 122/136 looper letters, 52 selfloop transitions, 14 changer transitions 110/260 dead transitions. [2023-11-10 11:42:58,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 260 transitions, 1157 flow [2023-11-10 11:42:58,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:42:58,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:42:58,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1473 transitions. [2023-11-10 11:42:58,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8331447963800905 [2023-11-10 11:42:58,281 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1473 transitions. [2023-11-10 11:42:58,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1473 transitions. [2023-11-10 11:42:58,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:42:58,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1473 transitions. [2023-11-10 11:42:58,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.3076923076923) internal successors, (1473), 13 states have internal predecessors, (1473), 0 states have call successors, (0), 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-10 11:42:58,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:42:58,290 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:42:58,290 INFO L175 Difference]: Start difference. First operand has 151 places, 114 transitions, 275 flow. Second operand 13 states and 1473 transitions. [2023-11-10 11:42:58,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 260 transitions, 1157 flow [2023-11-10 11:42:58,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 260 transitions, 1126 flow, removed 12 selfloop flow, removed 4 redundant places. [2023-11-10 11:42:58,445 INFO L231 Difference]: Finished difference. Result has 150 places, 125 transitions, 434 flow [2023-11-10 11:42:58,445 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=434, PETRI_PLACES=150, PETRI_TRANSITIONS=125} [2023-11-10 11:42:58,447 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 8 predicate places. [2023-11-10 11:42:58,447 INFO L495 AbstractCegarLoop]: Abstraction has has 150 places, 125 transitions, 434 flow [2023-11-10 11:42:58,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.42857142857143) internal successors, (717), 7 states have internal predecessors, (717), 0 states have call successors, (0), 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-10 11:42:58,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:42:58,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:42:58,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-10 11:42:58,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:42:58,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:42:58,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1429901368, now seen corresponding path program 1 times [2023-11-10 11:42:58,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:42:58,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831079883] [2023-11-10 11:42:58,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:42:58,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:42:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:42:58,770 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-10 11:42:58,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:42:58,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831079883] [2023-11-10 11:42:58,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831079883] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:42:58,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:42:58,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:42:58,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587474326] [2023-11-10 11:42:58,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:42:58,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:42:58,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:42:58,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:42:58,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:42:58,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 136 [2023-11-10 11:42:58,775 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 125 transitions, 434 flow. Second operand has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 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-10 11:42:58,775 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:42:58,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 136 [2023-11-10 11:42:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:01,368 INFO L124 PetriNetUnfolderBase]: 8751/15318 cut-off events. [2023-11-10 11:43:01,368 INFO L125 PetriNetUnfolderBase]: For 47091/47110 co-relation queries the response was YES. [2023-11-10 11:43:01,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50464 conditions, 15318 events. 8751/15318 cut-off events. For 47091/47110 co-relation queries the response was YES. Maximal size of possible extension queue 817. Compared 121471 event pairs, 1144 based on Foata normal form. 340/15468 useless extension candidates. Maximal degree in co-relation 50386. Up to 3567 conditions per place. [2023-11-10 11:43:01,523 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 58 selfloop transitions, 12 changer transitions 118/272 dead transitions. [2023-11-10 11:43:01,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 272 transitions, 1742 flow [2023-11-10 11:43:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:43:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:43:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1455 transitions. [2023-11-10 11:43:01,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8229638009049773 [2023-11-10 11:43:01,527 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1455 transitions. [2023-11-10 11:43:01,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1455 transitions. [2023-11-10 11:43:01,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:01,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1455 transitions. [2023-11-10 11:43:01,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 111.92307692307692) internal successors, (1455), 13 states have internal predecessors, (1455), 0 states have call successors, (0), 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-10 11:43:01,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:01,534 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:01,534 INFO L175 Difference]: Start difference. First operand has 150 places, 125 transitions, 434 flow. Second operand 13 states and 1455 transitions. [2023-11-10 11:43:01,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 272 transitions, 1742 flow [2023-11-10 11:43:01,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 272 transitions, 1624 flow, removed 59 selfloop flow, removed 6 redundant places. [2023-11-10 11:43:01,816 INFO L231 Difference]: Finished difference. Result has 159 places, 133 transitions, 586 flow [2023-11-10 11:43:01,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=586, PETRI_PLACES=159, PETRI_TRANSITIONS=133} [2023-11-10 11:43:01,818 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 17 predicate places. [2023-11-10 11:43:01,818 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 133 transitions, 586 flow [2023-11-10 11:43:01,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.57142857142857) internal successors, (718), 7 states have internal predecessors, (718), 0 states have call successors, (0), 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-10 11:43:01,819 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:01,819 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:01,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-10 11:43:01,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:01,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:01,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1842657687, now seen corresponding path program 1 times [2023-11-10 11:43:01,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:01,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433738596] [2023-11-10 11:43:01,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:01,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:02,036 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-10 11:43:02,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:02,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433738596] [2023-11-10 11:43:02,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433738596] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:02,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:02,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-10 11:43:02,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520126274] [2023-11-10 11:43:02,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:02,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-10 11:43:02,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:02,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-10 11:43:02,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-10 11:43:02,040 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2023-11-10 11:43:02,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 133 transitions, 586 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 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-10 11:43:02,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:02,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2023-11-10 11:43:02,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:04,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), 95#L879true, P1Thread1of1ForFork3InUse, Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, P2Thread1of1ForFork0InUse, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:04,777 INFO L294 olderBase$Statistics]: this new event has 86 ancestors and is cut-off event [2023-11-10 11:43:04,777 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-10 11:43:04,778 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-10 11:43:04,778 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2023-11-10 11:43:05,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [32#L880true, 213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 177#true, P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 78#L845true, Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:05,199 INFO L294 olderBase$Statistics]: this new event has 87 ancestors and is cut-off event [2023-11-10 11:43:05,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-10 11:43:05,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-10 11:43:05,199 INFO L297 olderBase$Statistics]: existing Event has 87 ancestors and is cut-off event [2023-11-10 11:43:05,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), 74#L2true, Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:05,488 INFO L294 olderBase$Statistics]: this new event has 88 ancestors and is cut-off event [2023-11-10 11:43:05,488 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-10 11:43:05,488 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-10 11:43:05,488 INFO L297 olderBase$Statistics]: existing Event has 88 ancestors and is cut-off event [2023-11-10 11:43:05,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 59#L3true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:05,897 INFO L294 olderBase$Statistics]: this new event has 89 ancestors and is cut-off event [2023-11-10 11:43:05,897 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-10 11:43:05,897 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-10 11:43:05,897 INFO L297 olderBase$Statistics]: existing Event has 89 ancestors and is cut-off event [2023-11-10 11:43:06,107 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][188], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), 177#true, P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), 254#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 135#L3-1true]) [2023-11-10 11:43:06,107 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,107 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,107 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,108 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,108 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 28#L2-1true, 249#true]) [2023-11-10 11:43:06,108 INFO L294 olderBase$Statistics]: this new event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,108 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,108 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,108 INFO L297 olderBase$Statistics]: existing Event has 90 ancestors and is cut-off event [2023-11-10 11:43:06,290 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 92#L880-1true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:06,290 INFO L294 olderBase$Statistics]: this new event has 91 ancestors and is cut-off event [2023-11-10 11:43:06,290 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-10 11:43:06,290 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-10 11:43:06,290 INFO L297 olderBase$Statistics]: existing Event has 91 ancestors and is cut-off event [2023-11-10 11:43:06,420 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), P1Thread1of1ForFork3InUse, Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, P2Thread1of1ForFork0InUse, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 112#L881true, Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:06,420 INFO L294 olderBase$Statistics]: this new event has 92 ancestors and is cut-off event [2023-11-10 11:43:06,420 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-10 11:43:06,420 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-10 11:43:06,420 INFO L297 olderBase$Statistics]: existing Event has 92 ancestors and is cut-off event [2023-11-10 11:43:06,526 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([420] L829-->L845: Formula: (let ((.cse8 (= (mod v_~b$r_buff1_thd4~0_56 256) 0)) (.cse4 (= (mod v_~b$r_buff0_thd4~0_60 256) 0))) (let ((.cse6 (not .cse4)) (.cse2 (and .cse8 .cse4)) (.cse9 (and (= (mod v_~b$w_buff1_used~0_133 256) 0) .cse4)) (.cse12 (= 0 (mod v_~b$w_buff0_used~0_144 256)))) (let ((.cse10 (or .cse2 .cse9 .cse12)) (.cse11 (and .cse6 (not .cse12)))) (let ((.cse3 (= (mod v_~b$w_buff1_used~0_132 256) 0)) (.cse5 (= (mod v_~b$w_buff0_used~0_143 256) 0)) (.cse1 (ite .cse10 v_~b~0_85 (ite .cse11 v_~b$w_buff0~0_65 v_~b$w_buff1~0_58))) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= v_~b$w_buff0~0_65 v_~b$w_buff0~0_64) (= v_~b~0_84 (ite .cse0 v_~b$mem_tmp~0_14 .cse1)) (= (ite .cse0 v_~b$r_buff0_thd4~0_60 (ite (or .cse2 (and .cse3 .cse4) .cse5) v_~b$r_buff0_thd4~0_60 (ite (and .cse6 (not .cse5)) 0 v_~b$r_buff0_thd4~0_60))) v_~b$r_buff0_thd4~0_59) (= v_~b$flush_delayed~0_23 0) (= v_~b$mem_tmp~0_14 v_~b~0_85) (= v_~b$w_buff1~0_58 v_~b$w_buff1~0_57) (= v_~b$r_buff1_thd4~0_55 (ite .cse0 v_~b$r_buff1_thd4~0_56 (ite (let ((.cse7 (= (mod v_~b$r_buff0_thd4~0_59 256) 0))) (or (and .cse3 .cse7) .cse5 (and .cse8 .cse7))) v_~b$r_buff1_thd4~0_56 0))) (= (ite .cse0 v_~b$w_buff1_used~0_133 (ite (or .cse2 .cse9 .cse5) v_~b$w_buff1_used~0_133 0)) v_~b$w_buff1_used~0_132) (= .cse1 v_~__unbuffered_p3_EBX~0_10) (= v_~b$w_buff0_used~0_143 (ite .cse0 v_~b$w_buff0_used~0_144 (ite .cse10 v_~b$w_buff0_used~0_144 (ite .cse11 0 v_~b$w_buff0_used~0_144))))))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_144, ~b~0=v_~b~0_85, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_133, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_56, ~b$w_buff1~0=v_~b$w_buff1~0_58, ~b$w_buff0~0=v_~b$w_buff0~0_65, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_60} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_14, ~b$flush_delayed~0=v_~b$flush_delayed~0_23, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_143, P3Thread1of1ForFork2_#t~nondet4=|v_P3Thread1of1ForFork2_#t~nondet4_1|, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~b~0=v_~b~0_84, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_132, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_55, ~b$w_buff1~0=v_~b$w_buff1~0_57, ~b$w_buff0~0=v_~b$w_buff0~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_59, P3Thread1of1ForFork2_#t~nondet3=|v_P3Thread1of1ForFork2_#t~nondet3_1|} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork2_#t~nondet4, ~weak$$choice0~0, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0, P3Thread1of1ForFork2_#t~nondet3][155], [213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), P2Thread1of1ForFork0InUse, Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 78#L845true, Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true, 127#L887true]) [2023-11-10 11:43:06,527 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is cut-off event [2023-11-10 11:43:06,527 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:43:06,527 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:43:06,527 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is cut-off event [2023-11-10 11:43:06,749 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([378] L887-->L890: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= 2 v_~z~0_4) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~z~0=v_~z~0_4, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][209], [24#L829true, 213#true, Black: 179#(= ~x~0 0), Black: 195#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), P1Thread1of1ForFork3InUse, P0Thread1of1ForFork1InUse, Black: 199#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 177#true, P2Thread1of1ForFork0InUse, Black: 180#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 191#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), P3Thread1of1ForFork2InUse, 7#L796true, 80#L816true, Black: 162#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 225#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 160#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (= ~z~0 0)), 52#L890true, Black: 166#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0)) (= ~z~0 0)), Black: 227#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0)))), Black: 235#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 231#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 155#(= ~z~0 0), Black: 233#(and (<= 1 ~main$tmp_guard1~0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), 115#L766true, Black: 229#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_~expression#1| 254) 0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 221#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0)), Black: 215#(= ~__unbuffered_p3_EAX~0 0), Black: 216#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~z~0))), Black: 223#(and (<= 1 ~main$tmp_guard1~0) (= ~__unbuffered_p3_EAX~0 0) (<= (div ~main$tmp_guard1~0 256) 0) (or (< 0 |ULTIMATE.start___VERIFIER_assert_#in~expression#1|) (< (+ |ULTIMATE.start___VERIFIER_assert_#in~expression#1| 254) 0))), Black: 217#(and (<= 1 ~main$tmp_guard1~0) (<= (div ~main$tmp_guard1~0 256) 0)), 249#true]) [2023-11-10 11:43:06,754 INFO L294 olderBase$Statistics]: this new event has 93 ancestors and is not cut-off event [2023-11-10 11:43:06,754 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-10 11:43:06,754 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-10 11:43:06,754 INFO L297 olderBase$Statistics]: existing Event has 93 ancestors and is not cut-off event [2023-11-10 11:43:07,023 INFO L124 PetriNetUnfolderBase]: 21727/36150 cut-off events. [2023-11-10 11:43:07,023 INFO L125 PetriNetUnfolderBase]: For 60360/71898 co-relation queries the response was YES. [2023-11-10 11:43:07,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91479 conditions, 36150 events. 21727/36150 cut-off events. For 60360/71898 co-relation queries the response was YES. Maximal size of possible extension queue 2304. Compared 317577 event pairs, 1487 based on Foata normal form. 280/34217 useless extension candidates. Maximal degree in co-relation 91397. Up to 13495 conditions per place. [2023-11-10 11:43:07,518 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 103 selfloop transitions, 20 changer transitions 0/229 dead transitions. [2023-11-10 11:43:07,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 229 transitions, 1240 flow [2023-11-10 11:43:07,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-10 11:43:07,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-10 11:43:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1169 transitions. [2023-11-10 11:43:07,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8595588235294118 [2023-11-10 11:43:07,522 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1169 transitions. [2023-11-10 11:43:07,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1169 transitions. [2023-11-10 11:43:07,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:07,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1169 transitions. [2023-11-10 11:43:07,526 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 116.9) internal successors, (1169), 10 states have internal predecessors, (1169), 0 states have call successors, (0), 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-10 11:43:07,528 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-10 11:43:07,528 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 0 states have call successors, (0), 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-10 11:43:07,529 INFO L175 Difference]: Start difference. First operand has 159 places, 133 transitions, 586 flow. Second operand 10 states and 1169 transitions. [2023-11-10 11:43:07,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 229 transitions, 1240 flow [2023-11-10 11:43:07,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 229 transitions, 1211 flow, removed 13 selfloop flow, removed 4 redundant places. [2023-11-10 11:43:07,682 INFO L231 Difference]: Finished difference. Result has 161 places, 151 transitions, 700 flow [2023-11-10 11:43:07,683 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=557, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=700, PETRI_PLACES=161, PETRI_TRANSITIONS=151} [2023-11-10 11:43:07,686 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 19 predicate places. [2023-11-10 11:43:07,686 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 151 transitions, 700 flow [2023-11-10 11:43:07,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 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-10 11:43:07,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:07,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:07,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-10 11:43:07,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:07,688 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1446732405, now seen corresponding path program 1 times [2023-11-10 11:43:07,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:07,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550379603] [2023-11-10 11:43:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:07,988 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-10 11:43:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550379603] [2023-11-10 11:43:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550379603] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:07,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:07,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:43:07,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909277312] [2023-11-10 11:43:07,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:07,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:43:07,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:07,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:43:07,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:43:07,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 136 [2023-11-10 11:43:07,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 151 transitions, 700 flow. Second operand has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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-10 11:43:07,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:07,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 136 [2023-11-10 11:43:07,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:12,125 INFO L124 PetriNetUnfolderBase]: 9654/24528 cut-off events. [2023-11-10 11:43:12,125 INFO L125 PetriNetUnfolderBase]: For 53431/57369 co-relation queries the response was YES. [2023-11-10 11:43:12,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72769 conditions, 24528 events. 9654/24528 cut-off events. For 53431/57369 co-relation queries the response was YES. Maximal size of possible extension queue 1514. Compared 289531 event pairs, 2651 based on Foata normal form. 520/23584 useless extension candidates. Maximal degree in co-relation 72678. Up to 4111 conditions per place. [2023-11-10 11:43:12,416 INFO L140 encePairwiseOnDemand]: 122/136 looper letters, 112 selfloop transitions, 50 changer transitions 13/277 dead transitions. [2023-11-10 11:43:12,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 277 transitions, 1877 flow [2023-11-10 11:43:12,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:43:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:43:12,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1441 transitions. [2023-11-10 11:43:12,420 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8150452488687783 [2023-11-10 11:43:12,420 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1441 transitions. [2023-11-10 11:43:12,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1441 transitions. [2023-11-10 11:43:12,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:12,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1441 transitions. [2023-11-10 11:43:12,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 110.84615384615384) internal successors, (1441), 13 states have internal predecessors, (1441), 0 states have call successors, (0), 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-10 11:43:12,426 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:12,427 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:12,427 INFO L175 Difference]: Start difference. First operand has 161 places, 151 transitions, 700 flow. Second operand 13 states and 1441 transitions. [2023-11-10 11:43:12,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 277 transitions, 1877 flow [2023-11-10 11:43:12,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 277 transitions, 1839 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-10 11:43:12,604 INFO L231 Difference]: Finished difference. Result has 178 places, 185 transitions, 1262 flow [2023-11-10 11:43:12,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1262, PETRI_PLACES=178, PETRI_TRANSITIONS=185} [2023-11-10 11:43:12,605 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 36 predicate places. [2023-11-10 11:43:12,605 INFO L495 AbstractCegarLoop]: Abstraction has has 178 places, 185 transitions, 1262 flow [2023-11-10 11:43:12,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 0 states have call successors, (0), 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-10 11:43:12,605 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:12,606 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:12,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-10 11:43:12,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:12,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:12,606 INFO L85 PathProgramCache]: Analyzing trace with hash 199351174, now seen corresponding path program 1 times [2023-11-10 11:43:12,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:12,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455537270] [2023-11-10 11:43:12,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:12,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:12,847 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-10 11:43:12,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:12,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455537270] [2023-11-10 11:43:12,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455537270] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:12,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:12,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-10 11:43:12,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714880680] [2023-11-10 11:43:12,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:12,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-10 11:43:12,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:12,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-10 11:43:12,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-10 11:43:12,854 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2023-11-10 11:43:12,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 185 transitions, 1262 flow. Second operand has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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-10 11:43:12,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:12,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2023-11-10 11:43:12,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:20,159 INFO L124 PetriNetUnfolderBase]: 27271/48254 cut-off events. [2023-11-10 11:43:20,160 INFO L125 PetriNetUnfolderBase]: For 134057/146246 co-relation queries the response was YES. [2023-11-10 11:43:20,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160005 conditions, 48254 events. 27271/48254 cut-off events. For 134057/146246 co-relation queries the response was YES. Maximal size of possible extension queue 3101. Compared 475362 event pairs, 1273 based on Foata normal form. 918/47580 useless extension candidates. Maximal degree in co-relation 159907. Up to 10393 conditions per place. [2023-11-10 11:43:20,770 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 140 selfloop transitions, 38 changer transitions 0/314 dead transitions. [2023-11-10 11:43:20,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 314 transitions, 2506 flow [2023-11-10 11:43:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-10 11:43:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-10 11:43:20,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1524 transitions. [2023-11-10 11:43:20,780 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8619909502262444 [2023-11-10 11:43:20,780 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1524 transitions. [2023-11-10 11:43:20,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1524 transitions. [2023-11-10 11:43:20,783 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:20,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1524 transitions. [2023-11-10 11:43:20,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 117.23076923076923) internal successors, (1524), 13 states have internal predecessors, (1524), 0 states have call successors, (0), 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-10 11:43:20,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:20,790 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 0 states have call successors, (0), 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-10 11:43:20,790 INFO L175 Difference]: Start difference. First operand has 178 places, 185 transitions, 1262 flow. Second operand 13 states and 1524 transitions. [2023-11-10 11:43:20,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 314 transitions, 2506 flow [2023-11-10 11:43:22,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 314 transitions, 2466 flow, removed 20 selfloop flow, removed 0 redundant places. [2023-11-10 11:43:22,019 INFO L231 Difference]: Finished difference. Result has 196 places, 202 transitions, 1473 flow [2023-11-10 11:43:22,019 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1180, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1473, PETRI_PLACES=196, PETRI_TRANSITIONS=202} [2023-11-10 11:43:22,020 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 54 predicate places. [2023-11-10 11:43:22,020 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 202 transitions, 1473 flow [2023-11-10 11:43:22,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 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-10 11:43:22,021 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:22,021 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:22,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-10 11:43:22,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:22,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1365017507, now seen corresponding path program 1 times [2023-11-10 11:43:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:22,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281348593] [2023-11-10 11:43:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:22,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:22,321 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-10 11:43:22,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:22,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281348593] [2023-11-10 11:43:22,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281348593] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:22,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:22,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:43:22,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534066112] [2023-11-10 11:43:22,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:22,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:43:22,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:22,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:43:22,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:43:22,326 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2023-11-10 11:43:22,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 202 transitions, 1473 flow. Second operand has 8 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 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-10 11:43:22,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:22,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2023-11-10 11:43:22,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:29,540 INFO L124 PetriNetUnfolderBase]: 25726/46029 cut-off events. [2023-11-10 11:43:29,540 INFO L125 PetriNetUnfolderBase]: For 192936/204305 co-relation queries the response was YES. [2023-11-10 11:43:30,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181237 conditions, 46029 events. 25726/46029 cut-off events. For 192936/204305 co-relation queries the response was YES. Maximal size of possible extension queue 3052. Compared 459775 event pairs, 1254 based on Foata normal form. 423/44842 useless extension candidates. Maximal degree in co-relation 181130. Up to 9738 conditions per place. [2023-11-10 11:43:30,389 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 133 selfloop transitions, 58 changer transitions 46/354 dead transitions. [2023-11-10 11:43:30,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 354 transitions, 3115 flow [2023-11-10 11:43:30,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-10 11:43:30,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-10 11:43:30,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1878 transitions. [2023-11-10 11:43:30,393 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8630514705882353 [2023-11-10 11:43:30,393 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1878 transitions. [2023-11-10 11:43:30,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1878 transitions. [2023-11-10 11:43:30,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:30,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1878 transitions. [2023-11-10 11:43:30,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 117.375) internal successors, (1878), 16 states have internal predecessors, (1878), 0 states have call successors, (0), 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-10 11:43:30,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-10 11:43:30,402 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 0 states have call successors, (0), 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-10 11:43:30,402 INFO L175 Difference]: Start difference. First operand has 196 places, 202 transitions, 1473 flow. Second operand 16 states and 1878 transitions. [2023-11-10 11:43:30,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 354 transitions, 3115 flow [2023-11-10 11:43:39,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 354 transitions, 2997 flow, removed 46 selfloop flow, removed 5 redundant places. [2023-11-10 11:43:39,538 INFO L231 Difference]: Finished difference. Result has 207 places, 209 transitions, 1614 flow [2023-11-10 11:43:39,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1614, PETRI_PLACES=207, PETRI_TRANSITIONS=209} [2023-11-10 11:43:39,539 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 65 predicate places. [2023-11-10 11:43:39,539 INFO L495 AbstractCegarLoop]: Abstraction has has 207 places, 209 transitions, 1614 flow [2023-11-10 11:43:39,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.375) internal successors, (867), 8 states have internal predecessors, (867), 0 states have call successors, (0), 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-10 11:43:39,540 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:39,540 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:39,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-10 11:43:39,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:39,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:39,541 INFO L85 PathProgramCache]: Analyzing trace with hash 462319288, now seen corresponding path program 1 times [2023-11-10 11:43:39,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:39,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675677484] [2023-11-10 11:43:39,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:39,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:39,833 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-10 11:43:39,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:39,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675677484] [2023-11-10 11:43:39,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675677484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:39,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:39,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-10 11:43:39,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783292489] [2023-11-10 11:43:39,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:39,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-10 11:43:39,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:39,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-10 11:43:39,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-10 11:43:39,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 136 [2023-11-10 11:43:39,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 209 transitions, 1614 flow. Second operand has 9 states, 9 states have (on average 108.44444444444444) internal successors, (976), 9 states have internal predecessors, (976), 0 states have call successors, (0), 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-10 11:43:39,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:39,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 136 [2023-11-10 11:43:39,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:43:45,890 INFO L124 PetriNetUnfolderBase]: 25662/45463 cut-off events. [2023-11-10 11:43:45,890 INFO L125 PetriNetUnfolderBase]: For 198849/209464 co-relation queries the response was YES. [2023-11-10 11:43:46,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179558 conditions, 45463 events. 25662/45463 cut-off events. For 198849/209464 co-relation queries the response was YES. Maximal size of possible extension queue 3087. Compared 450558 event pairs, 1584 based on Foata normal form. 204/43895 useless extension candidates. Maximal degree in co-relation 179510. Up to 5757 conditions per place. [2023-11-10 11:43:46,800 INFO L140 encePairwiseOnDemand]: 125/136 looper letters, 117 selfloop transitions, 63 changer transitions 46/343 dead transitions. [2023-11-10 11:43:46,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 343 transitions, 3085 flow [2023-11-10 11:43:46,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-10 11:43:46,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-10 11:43:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2181 transitions. [2023-11-10 11:43:46,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.8440402476780186 [2023-11-10 11:43:46,806 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2181 transitions. [2023-11-10 11:43:46,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2181 transitions. [2023-11-10 11:43:46,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:43:46,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2181 transitions. [2023-11-10 11:43:46,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 114.78947368421052) internal successors, (2181), 19 states have internal predecessors, (2181), 0 states have call successors, (0), 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-10 11:43:46,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 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-10 11:43:46,818 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 0 states have call successors, (0), 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-10 11:43:46,818 INFO L175 Difference]: Start difference. First operand has 207 places, 209 transitions, 1614 flow. Second operand 19 states and 2181 transitions. [2023-11-10 11:43:46,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 343 transitions, 3085 flow [2023-11-10 11:43:58,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 343 transitions, 2499 flow, removed 248 selfloop flow, removed 24 redundant places. [2023-11-10 11:43:58,145 INFO L231 Difference]: Finished difference. Result has 202 places, 208 transitions, 1367 flow [2023-11-10 11:43:58,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1367, PETRI_PLACES=202, PETRI_TRANSITIONS=208} [2023-11-10 11:43:58,146 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 60 predicate places. [2023-11-10 11:43:58,146 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 208 transitions, 1367 flow [2023-11-10 11:43:58,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 108.44444444444444) internal successors, (976), 9 states have internal predecessors, (976), 0 states have call successors, (0), 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-10 11:43:58,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:43:58,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:43:58,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-10 11:43:58,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:43:58,147 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:43:58,147 INFO L85 PathProgramCache]: Analyzing trace with hash 61418863, now seen corresponding path program 1 times [2023-11-10 11:43:58,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:43:58,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104193332] [2023-11-10 11:43:58,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:43:58,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:43:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:43:58,469 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-10 11:43:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:43:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104193332] [2023-11-10 11:43:58,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104193332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:43:58,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:43:58,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-10 11:43:58,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209287131] [2023-11-10 11:43:58,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:43:58,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-10 11:43:58,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:43:58,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-10 11:43:58,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-10 11:43:58,474 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 136 [2023-11-10 11:43:58,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 208 transitions, 1367 flow. Second operand has 8 states, 8 states have (on average 101.75) internal successors, (814), 8 states have internal predecessors, (814), 0 states have call successors, (0), 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-10 11:43:58,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:43:58,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 136 [2023-11-10 11:43:58,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:01,650 INFO L124 PetriNetUnfolderBase]: 8807/27382 cut-off events. [2023-11-10 11:44:01,651 INFO L125 PetriNetUnfolderBase]: For 67523/71888 co-relation queries the response was YES. [2023-11-10 11:44:01,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90118 conditions, 27382 events. 8807/27382 cut-off events. For 67523/71888 co-relation queries the response was YES. Maximal size of possible extension queue 3570. Compared 398648 event pairs, 192 based on Foata normal form. 27/25510 useless extension candidates. Maximal degree in co-relation 90011. Up to 2845 conditions per place. [2023-11-10 11:44:02,004 INFO L140 encePairwiseOnDemand]: 121/136 looper letters, 66 selfloop transitions, 42 changer transitions 25/278 dead transitions. [2023-11-10 11:44:02,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 278 transitions, 2160 flow [2023-11-10 11:44:02,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-10 11:44:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-10 11:44:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 967 transitions. [2023-11-10 11:44:02,006 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7900326797385621 [2023-11-10 11:44:02,006 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 967 transitions. [2023-11-10 11:44:02,006 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 967 transitions. [2023-11-10 11:44:02,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:02,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 967 transitions. [2023-11-10 11:44:02,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 107.44444444444444) internal successors, (967), 9 states have internal predecessors, (967), 0 states have call successors, (0), 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-10 11:44:02,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-10 11:44:02,011 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 0 states have call successors, (0), 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-10 11:44:02,011 INFO L175 Difference]: Start difference. First operand has 202 places, 208 transitions, 1367 flow. Second operand 9 states and 967 transitions. [2023-11-10 11:44:02,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 278 transitions, 2160 flow [2023-11-10 11:44:05,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 278 transitions, 1986 flow, removed 39 selfloop flow, removed 17 redundant places. [2023-11-10 11:44:05,402 INFO L231 Difference]: Finished difference. Result has 196 places, 222 transitions, 1548 flow [2023-11-10 11:44:05,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1233, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1548, PETRI_PLACES=196, PETRI_TRANSITIONS=222} [2023-11-10 11:44:05,404 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 54 predicate places. [2023-11-10 11:44:05,404 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 222 transitions, 1548 flow [2023-11-10 11:44:05,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 101.75) internal successors, (814), 8 states have internal predecessors, (814), 0 states have call successors, (0), 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-10 11:44:05,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:05,405 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-10 11:44:05,405 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:05,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1785517367, now seen corresponding path program 2 times [2023-11-10 11:44:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990320919] [2023-11-10 11:44:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:05,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-10 11:44:06,747 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-10 11:44:06,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-10 11:44:06,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990320919] [2023-11-10 11:44:06,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990320919] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-10 11:44:06,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-10 11:44:06,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-10 11:44:06,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103503699] [2023-11-10 11:44:06,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-10 11:44:06,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-10 11:44:06,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-10 11:44:06,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-10 11:44:06,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-11-10 11:44:06,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 136 [2023-11-10 11:44:06,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 222 transitions, 1548 flow. Second operand has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 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-10 11:44:06,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-10 11:44:06,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 136 [2023-11-10 11:44:06,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-10 11:44:11,686 INFO L124 PetriNetUnfolderBase]: 12981/40714 cut-off events. [2023-11-10 11:44:11,686 INFO L125 PetriNetUnfolderBase]: For 75895/77290 co-relation queries the response was YES. [2023-11-10 11:44:12,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119523 conditions, 40714 events. 12981/40714 cut-off events. For 75895/77290 co-relation queries the response was YES. Maximal size of possible extension queue 4954. Compared 632928 event pairs, 146 based on Foata normal form. 75/38310 useless extension candidates. Maximal degree in co-relation 119483. Up to 4305 conditions per place. [2023-11-10 11:44:12,161 INFO L140 encePairwiseOnDemand]: 116/136 looper letters, 98 selfloop transitions, 111 changer transitions 23/371 dead transitions. [2023-11-10 11:44:12,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 371 transitions, 3492 flow [2023-11-10 11:44:12,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-10 11:44:12,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-10 11:44:12,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1493 transitions. [2023-11-10 11:44:12,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7318627450980392 [2023-11-10 11:44:12,164 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1493 transitions. [2023-11-10 11:44:12,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1493 transitions. [2023-11-10 11:44:12,164 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-10 11:44:12,164 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1493 transitions. [2023-11-10 11:44:12,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 99.53333333333333) internal successors, (1493), 15 states have internal predecessors, (1493), 0 states have call successors, (0), 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-10 11:44:12,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-10 11:44:12,170 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 0 states have call successors, (0), 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-10 11:44:12,170 INFO L175 Difference]: Start difference. First operand has 196 places, 222 transitions, 1548 flow. Second operand 15 states and 1493 transitions. [2023-11-10 11:44:12,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 371 transitions, 3492 flow [2023-11-10 11:44:21,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 371 transitions, 3476 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-10 11:44:21,236 INFO L231 Difference]: Finished difference. Result has 212 places, 291 transitions, 2929 flow [2023-11-10 11:44:21,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=2929, PETRI_PLACES=212, PETRI_TRANSITIONS=291} [2023-11-10 11:44:21,237 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 70 predicate places. [2023-11-10 11:44:21,237 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 291 transitions, 2929 flow [2023-11-10 11:44:21,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 93.84615384615384) internal successors, (1220), 13 states have internal predecessors, (1220), 0 states have call successors, (0), 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-10 11:44:21,238 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-10 11:44:21,238 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:21,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-10 11:44:21,238 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-11-10 11:44:21,238 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-10 11:44:21,239 INFO L85 PathProgramCache]: Analyzing trace with hash 109669943, now seen corresponding path program 3 times [2023-11-10 11:44:21,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-10 11:44:21,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753806640] [2023-11-10 11:44:21,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-10 11:44:21,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-10 11:44:21,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:44:21,305 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-10 11:44:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-10 11:44:21,384 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-10 11:44:21,384 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-10 11:44:21,385 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-11-10 11:44:21,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-11-10 11:44:21,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-11-10 11:44:21,387 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-11-10 11:44:21,390 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-11-10 11:44:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-11-10 11:44:21,391 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-11-10 11:44:21,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-10 11:44:21,391 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-10 11:44:21,398 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-10 11:44:21,398 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-10 11:44:21,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-10 11:44:21,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-10 11:44:21,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-10 11:44:21,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-10 11:44:21,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:44:21 BasicIcfg [2023-11-10 11:44:21,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-10 11:44:21,524 INFO L158 Benchmark]: Toolchain (without parser) took 91076.34ms. Allocated memory was 184.5MB in the beginning and 7.2GB in the end (delta: 7.0GB). Free memory was 137.0MB in the beginning and 3.6GB in the end (delta: -3.4GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-11-10 11:44:21,524 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 67.2kB). There was no memory consumed. Max. memory is 8.0GB. [2023-11-10 11:44:21,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.39ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 112.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2023-11-10 11:44:21,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.89ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 110.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-11-10 11:44:21,530 INFO L158 Benchmark]: Boogie Preprocessor took 30.75ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-11-10 11:44:21,531 INFO L158 Benchmark]: RCFGBuilder took 651.88ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 108.0MB in the beginning and 208.4MB in the end (delta: -100.3MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2023-11-10 11:44:21,531 INFO L158 Benchmark]: TraceAbstraction took 89827.33ms. Allocated memory was 262.1MB in the beginning and 7.2GB in the end (delta: 6.9GB). Free memory was 207.9MB in the beginning and 3.6GB in the end (delta: -3.3GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. [2023-11-10 11:44:21,532 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.15ms. Allocated memory is still 184.5MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 67.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 510.39ms. Allocated memory is still 184.5MB. Free memory was 136.7MB in the beginning and 112.6MB in the end (delta: 24.1MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.89ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 110.1MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.75ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 108.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 651.88ms. Allocated memory was 184.5MB in the beginning and 262.1MB in the end (delta: 77.6MB). Free memory was 108.0MB in the beginning and 208.4MB in the end (delta: -100.3MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. * TraceAbstraction took 89827.33ms. Allocated memory was 262.1MB in the beginning and 7.2GB in the end (delta: 6.9GB). Free memory was 207.9MB in the beginning and 3.6GB in the end (delta: -3.3GB). Peak memory consumption was 3.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 Unfinished Backtranslation: IdentifierExpression #t~pre11 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: - 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; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool b$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b=0] [L722] 0 int b$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b=0] [L723] 0 _Bool b$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b=0] [L724] 0 _Bool b$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b=0] [L725] 0 _Bool b$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b=0] [L726] 0 _Bool b$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b=0] [L727] 0 _Bool b$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b=0] [L728] 0 _Bool b$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b=0] [L729] 0 _Bool b$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b=0] [L730] 0 _Bool b$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b=0] [L731] 0 _Bool b$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b=0] [L732] 0 _Bool b$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b=0] [L733] 0 _Bool b$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b=0] [L734] 0 int *b$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b=0] [L735] 0 int b$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b=0] [L736] 0 _Bool b$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b=0] [L737] 0 int b$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b=0] [L738] 0 _Bool b$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0] [L739] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0] [L740] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L742] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L744] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L746] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L869] 0 pthread_t t1161; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t1163; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L875] 0 pthread_t t1164; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice2=1, x=2, y=1, z=2] [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=2] [L18] 0 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, 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: 872]: 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: 870]: 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: 874]: 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: 876]: 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, 173 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: 89.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 84.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1205 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1205 mSDsluCounter, 1102 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 892 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2224 IncrementalHoareTripleChecker+Invalid, 2314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 210 mSDtfsCounter, 2224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2929occurred in iteration=11, InterpolantAutomatonStates: 133, 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.4s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1062 NumberOfCodeBlocks, 1062 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 948 ConstructedInterpolants, 0 QuantifiedInterpolants, 3905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-10 11:44:21,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...