/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/mix006_power.oepc_pso.oepc_rmo.oepc.i


--------------------------------------------------------------------------------


This is Ultimate 0.2.3-wip.dk.fix-rcfgbuilder-lbe-0ccecc1-m
[2023-11-10 11:37:39,427 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-10 11:37:39,481 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:37:39,501 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-10 11:37:39,502 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-10 11:37:39,502 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-10 11:37:39,502 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-10 11:37:39,502 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-10 11:37:39,503 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-10 11:37:39,503 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-10 11:37:39,503 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-10 11:37:39,503 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-10 11:37:39,504 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-10 11:37:39,506 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-10 11:37:39,507 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-10 11:37:39,507 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-10 11:37:39,507 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-10 11:37:39,507 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-10 11:37:39,507 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-10 11:37:39,508 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-10 11:37:39,508 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-10 11:37:39,509 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-10 11:37:39,509 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-10 11:37:39,509 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-10 11:37:39,509 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-10 11:37:39,509 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:37:39,510 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-10 11:37:39,510 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-10 11:37:39,510 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-10 11:37:39,510 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-10 11:37:39,510 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-10 11:37:39,510 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-11-10 11:37:39,511 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-10 11:37:39,511 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:37:39,681 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-10 11:37:39,699 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-10 11:37:39,701 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-10 11:37:39,702 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-10 11:37:39,702 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-10 11:37:39,703 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-10 11:37:40,707 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-10 11:37:40,932 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-10 11:37:40,933 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-10 11:37:40,951 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d58302ff/9bb3a06dd0f146878a6052034fe9ed80/FLAGcde86ecec
[2023-11-10 11:37:40,969 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d58302ff/9bb3a06dd0f146878a6052034fe9ed80
[2023-11-10 11:37:40,972 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-10 11:37:40,973 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-10 11:37:40,974 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-10 11:37:40,974 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-10 11:37:40,979 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-10 11:37:40,979 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:37:40" (1/1) ...
[2023-11-10 11:37:40,980 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e202e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:40, skipping insertion in model container
[2023-11-10 11:37:40,980 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:37:40" (1/1) ...
[2023-11-10 11:37:41,031 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-10 11:37:41,155 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/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-10 11:37:41,326 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:37:41,341 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-10 11:37:41,349 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/mix006_power.oepc_pso.oepc_rmo.oepc.i[969,982]
[2023-11-10 11:37:41,376 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-10 11:37:41,414 WARN  L672               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-10 11:37:41,415 WARN  L672               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-10 11:37:41,420 INFO  L206         MainTranslator]: Completed translation
[2023-11-10 11:37:41,420 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41 WrapperNode
[2023-11-10 11:37:41,421 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-10 11:37:41,421 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-10 11:37:41,421 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-10 11:37:41,422 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-10 11:37:41,426 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:37:41" (1/1) ...
[2023-11-10 11:37:41,437 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:37:41" (1/1) ...
[2023-11-10 11:37:41,459 INFO  L138                Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129
[2023-11-10 11:37:41,459 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-10 11:37:41,460 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-10 11:37:41,460 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-10 11:37:41,460 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-10 11:37:41,467 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,467 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,470 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,470 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,475 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,477 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,478 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,479 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,481 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-10 11:37:41,482 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-10 11:37:41,482 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-10 11:37:41,482 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-10 11:37:41,483 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (1/1) ...
[2023-11-10 11:37:41,486 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-10 11:37:41,496 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-10 11:37:41,522 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:37:41,531 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:37:41,556 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-10 11:37:41,556 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-10 11:37:41,557 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-10 11:37:41,557 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-10 11:37:41,557 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-10 11:37:41,557 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-10 11:37:41,558 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-10 11:37:41,558 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-10 11:37:41,558 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-10 11:37:41,558 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-11-10 11:37:41,558 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-11-10 11:37:41,558 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-10 11:37:41,558 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-10 11:37:41,558 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-10 11:37:41,558 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-10 11:37:41,559 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:37:41,681 INFO  L236             CfgBuilder]: Building ICFG
[2023-11-10 11:37:41,683 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-10 11:37:41,921 INFO  L277             CfgBuilder]: Performing block encoding
[2023-11-10 11:37:42,057 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-10 11:37:42,057 INFO  L302             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-10 11:37:42,062 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:37:42 BoogieIcfgContainer
[2023-11-10 11:37:42,062 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-10 11:37:42,064 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-10 11:37:42,064 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-10 11:37:42,067 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-10 11:37:42,067 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:37:40" (1/3) ...
[2023-11-10 11:37:42,068 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59efb434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:37:42, skipping insertion in model container
[2023-11-10 11:37:42,068 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:37:41" (2/3) ...
[2023-11-10 11:37:42,068 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59efb434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:37:42, skipping insertion in model container
[2023-11-10 11:37:42,069 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:37:42" (3/3) ...
[2023-11-10 11:37:42,070 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i
[2023-11-10 11:37:42,082 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-10 11:37:42,082 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-10 11:37:42,082 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-10 11:37:42,131 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-10 11:37:42,167 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 123 places, 116 transitions, 244 flow
[2023-11-10 11:37:42,205 INFO  L124   PetriNetUnfolderBase]: 3/113 cut-off events.
[2023-11-10 11:37:42,205 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:37:42,213 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 3/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 64 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 76. Up to 2 conditions per place. 
[2023-11-10 11:37:42,213 INFO  L82        GeneralOperation]: Start removeDead. Operand has 123 places, 116 transitions, 244 flow
[2023-11-10 11:37:42,216 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 113 transitions, 235 flow
[2023-11-10 11:37:42,222 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-10 11:37:42,227 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;@2afd634e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-10 11:37:42,227 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2023-11-10 11:37:42,236 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-10 11:37:42,236 INFO  L124   PetriNetUnfolderBase]: 1/46 cut-off events.
[2023-11-10 11:37:42,236 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-10 11:37:42,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:42,237 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]
[2023-11-10 11:37:42,237 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:42,241 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:42,241 INFO  L85        PathProgramCache]: Analyzing trace with hash 1690816652, now seen corresponding path program 1 times
[2023-11-10 11:37:42,247 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:42,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290855655]
[2023-11-10 11:37:42,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:42,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:42,364 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:42,695 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:37:42,695 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:42,696 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290855655]
[2023-11-10 11:37:42,696 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290855655] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:42,696 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:42,696 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-10 11:37:42,697 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282271428]
[2023-11-10 11:37:42,698 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:42,705 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-10 11:37:42,709 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:42,735 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-10 11:37:42,735 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-10 11:37:42,738 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 116
[2023-11-10 11:37:42,742 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 235 flow. Second operand  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:37:42,742 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:42,742 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 116
[2023-11-10 11:37:42,743 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:42,890 INFO  L124   PetriNetUnfolderBase]: 58/276 cut-off events.
[2023-11-10 11:37:42,891 INFO  L125   PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES.
[2023-11-10 11:37:42,893 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 405 conditions, 276 events. 58/276 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1110 event pairs, 10 based on Foata normal form. 25/284 useless extension candidates. Maximal degree in co-relation 355. Up to 79 conditions per place. 
[2023-11-10 11:37:42,895 INFO  L140   encePairwiseOnDemand]: 110/116 looper letters, 14 selfloop transitions, 2 changer transitions 0/114 dead transitions.
[2023-11-10 11:37:42,896 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 114 transitions, 275 flow
[2023-11-10 11:37:42,899 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-10 11:37:42,901 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-10 11:37:42,910 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions.
[2023-11-10 11:37:42,914 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9339080459770115
[2023-11-10 11:37:42,914 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 325 transitions.
[2023-11-10 11:37:42,915 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions.
[2023-11-10 11:37:42,918 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:42,920 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions.
[2023-11-10 11:37:42,925 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:42,930 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:42,930 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:42,932 INFO  L175             Difference]: Start difference. First operand has 120 places, 113 transitions, 235 flow. Second operand 3 states and 325 transitions.
[2023-11-10 11:37:42,932 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 114 transitions, 275 flow
[2023-11-10 11:37:42,937 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 114 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places.
[2023-11-10 11:37:42,941 INFO  L231             Difference]: Finished difference. Result has 117 places, 108 transitions, 226 flow
[2023-11-10 11:37:42,943 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=117, PETRI_TRANSITIONS=108}
[2023-11-10 11:37:42,947 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, -3 predicate places.
[2023-11-10 11:37:42,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 117 places, 108 transitions, 226 flow
[2023-11-10 11:37:42,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 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:37:42,948 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:42,948 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]
[2023-11-10 11:37:42,948 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-10 11:37:42,949 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:42,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:42,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 1312741578, now seen corresponding path program 1 times
[2023-11-10 11:37:42,950 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:42,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976806319]
[2023-11-10 11:37:42,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:42,951 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:43,024 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:43,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:37:43,321 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:43,322 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976806319]
[2023-11-10 11:37:43,322 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976806319] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:43,322 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:43,322 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-10 11:37:43,322 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916056761]
[2023-11-10 11:37:43,322 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:43,324 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-10 11:37:43,324 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:43,324 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-10 11:37:43,324 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:37:43,325 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2023-11-10 11:37:43,326 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 108 transitions, 226 flow. Second operand  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:37:43,326 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:43,326 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2023-11-10 11:37:43,326 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:44,596 INFO  L124   PetriNetUnfolderBase]: 4162/8528 cut-off events.
[2023-11-10 11:37:44,597 INFO  L125   PetriNetUnfolderBase]: For 338/338 co-relation queries the response was YES.
[2023-11-10 11:37:44,619 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 15110 conditions, 8528 events. 4162/8528 cut-off events. For 338/338 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 69565 event pairs, 1057 based on Foata normal form. 0/8270 useless extension candidates. Maximal degree in co-relation 15056. Up to 2688 conditions per place. 
[2023-11-10 11:37:44,639 INFO  L140   encePairwiseOnDemand]: 99/116 looper letters, 30 selfloop transitions, 11 changer transitions 89/200 dead transitions.
[2023-11-10 11:37:44,639 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 200 transitions, 666 flow
[2023-11-10 11:37:44,640 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2023-11-10 11:37:44,640 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2023-11-10 11:37:44,642 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 869 transitions.
[2023-11-10 11:37:44,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8323754789272031
[2023-11-10 11:37:44,642 INFO  L72            ComplementDD]: Start complementDD. Operand 9 states and 869 transitions.
[2023-11-10 11:37:44,642 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 9 states and 869 transitions.
[2023-11-10 11:37:44,643 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:44,643 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 869 transitions.
[2023-11-10 11:37:44,644 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 10 states, 9 states have (on average 96.55555555555556) internal successors, (869), 9 states have internal predecessors, (869), 0 states have call successors, (0), 0 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:37:44,647 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:44,648 INFO  L81            ComplementDD]: Finished complementDD. Result  has 10 states, 10 states have (on average 116.0) internal successors, (1160), 10 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:44,648 INFO  L175             Difference]: Start difference. First operand has 117 places, 108 transitions, 226 flow. Second operand 9 states and 869 transitions.
[2023-11-10 11:37:44,648 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 200 transitions, 666 flow
[2023-11-10 11:37:44,652 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 200 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-10 11:37:44,654 INFO  L231             Difference]: Finished difference. Result has 131 places, 101 transitions, 314 flow
[2023-11-10 11:37:44,654 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=101}
[2023-11-10 11:37:44,655 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 11 predicate places.
[2023-11-10 11:37:44,655 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 314 flow
[2023-11-10 11:37:44,655 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 0 states have call successors, (0), 0 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:37:44,655 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:44,655 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]
[2023-11-10 11:37:44,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-10 11:37:44,656 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:44,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:44,658 INFO  L85        PathProgramCache]: Analyzing trace with hash 779290345, now seen corresponding path program 1 times
[2023-11-10 11:37:44,658 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:44,658 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427551831]
[2023-11-10 11:37:44,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:44,659 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:44,705 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:44,884 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:37:44,885 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:44,886 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427551831]
[2023-11-10 11:37:44,887 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427551831] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:44,890 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:44,890 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:37:44,890 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484228947]
[2023-11-10 11:37:44,890 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:44,891 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:37:44,891 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:44,891 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:37:44,891 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:37:44,892 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2023-11-10 11:37:44,893 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 101 transitions, 314 flow. Second operand  has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 0 states have call successors, (0), 0 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:37:44,893 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:44,893 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2023-11-10 11:37:44,893 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:45,701 INFO  L124   PetriNetUnfolderBase]: 2089/3986 cut-off events.
[2023-11-10 11:37:45,701 INFO  L125   PetriNetUnfolderBase]: For 5989/5992 co-relation queries the response was YES.
[2023-11-10 11:37:45,712 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12067 conditions, 3986 events. 2089/3986 cut-off events. For 5989/5992 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 27773 event pairs, 255 based on Foata normal form. 114/4013 useless extension candidates. Maximal degree in co-relation 11997. Up to 1155 conditions per place. 
[2023-11-10 11:37:45,728 INFO  L140   encePairwiseOnDemand]: 106/116 looper letters, 43 selfloop transitions, 7 changer transitions 88/208 dead transitions.
[2023-11-10 11:37:45,728 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 208 transitions, 1150 flow
[2023-11-10 11:37:45,729 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-10 11:37:45,729 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-10 11:37:45,730 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1203 transitions.
[2023-11-10 11:37:45,731 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7977453580901857
[2023-11-10 11:37:45,731 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1203 transitions.
[2023-11-10 11:37:45,731 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1203 transitions.
[2023-11-10 11:37:45,732 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:45,732 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1203 transitions.
[2023-11-10 11:37:45,796 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 92.53846153846153) internal successors, (1203), 13 states have internal predecessors, (1203), 0 states have call successors, (0), 0 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:37:45,798 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:45,799 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:45,799 INFO  L175             Difference]: Start difference. First operand has 131 places, 101 transitions, 314 flow. Second operand 13 states and 1203 transitions.
[2023-11-10 11:37:45,799 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 208 transitions, 1150 flow
[2023-11-10 11:37:45,812 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 208 transitions, 1044 flow, removed 12 selfloop flow, removed 2 redundant places.
[2023-11-10 11:37:45,814 INFO  L231             Difference]: Finished difference. Result has 134 places, 104 transitions, 370 flow
[2023-11-10 11:37:45,815 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=370, PETRI_PLACES=134, PETRI_TRANSITIONS=104}
[2023-11-10 11:37:45,815 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 14 predicate places.
[2023-11-10 11:37:45,815 INFO  L495      AbstractCegarLoop]: Abstraction has has 134 places, 104 transitions, 370 flow
[2023-11-10 11:37:45,816 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 85.28571428571429) internal successors, (597), 7 states have internal predecessors, (597), 0 states have call successors, (0), 0 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:37:45,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:45,816 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]
[2023-11-10 11:37:45,816 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-10 11:37:45,816 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:45,817 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:45,817 INFO  L85        PathProgramCache]: Analyzing trace with hash -1954645929, now seen corresponding path program 1 times
[2023-11-10 11:37:45,817 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:45,817 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802334220]
[2023-11-10 11:37:45,817 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:45,817 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:45,834 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:45,986 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:37:45,986 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:45,986 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802334220]
[2023-11-10 11:37:45,987 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802334220] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:45,987 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:45,987 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:37:45,987 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283467244]
[2023-11-10 11:37:45,987 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:45,991 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:37:45,992 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:45,993 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:37:45,993 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:37:45,994 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 116
[2023-11-10 11:37:45,995 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 104 transitions, 370 flow. Second operand  has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:37:45,995 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:45,996 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 116
[2023-11-10 11:37:45,996 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:46,651 INFO  L124   PetriNetUnfolderBase]: 1511/3090 cut-off events.
[2023-11-10 11:37:46,651 INFO  L125   PetriNetUnfolderBase]: For 6941/6944 co-relation queries the response was YES.
[2023-11-10 11:37:46,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9886 conditions, 3090 events. 1511/3090 cut-off events. For 6941/6944 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 21050 event pairs, 222 based on Foata normal form. 72/3073 useless extension candidates. Maximal degree in co-relation 9808. Up to 980 conditions per place. 
[2023-11-10 11:37:46,672 INFO  L140   encePairwiseOnDemand]: 103/116 looper letters, 40 selfloop transitions, 13 changer transitions 70/193 dead transitions.
[2023-11-10 11:37:46,672 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 193 transitions, 1124 flow
[2023-11-10 11:37:46,673 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-10 11:37:46,673 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-10 11:37:46,675 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1191 transitions.
[2023-11-10 11:37:46,676 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7897877984084881
[2023-11-10 11:37:46,676 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1191 transitions.
[2023-11-10 11:37:46,676 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1191 transitions.
[2023-11-10 11:37:46,677 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:46,677 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1191 transitions.
[2023-11-10 11:37:46,679 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 91.61538461538461) internal successors, (1191), 13 states have internal predecessors, (1191), 0 states have call successors, (0), 0 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:37:46,681 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:46,681 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:46,681 INFO  L175             Difference]: Start difference. First operand has 134 places, 104 transitions, 370 flow. Second operand 13 states and 1191 transitions.
[2023-11-10 11:37:46,681 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 193 transitions, 1124 flow
[2023-11-10 11:37:46,719 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 193 transitions, 1039 flow, removed 40 selfloop flow, removed 7 redundant places.
[2023-11-10 11:37:46,721 INFO  L231             Difference]: Finished difference. Result has 142 places, 109 transitions, 474 flow
[2023-11-10 11:37:46,722 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=474, PETRI_PLACES=142, PETRI_TRANSITIONS=109}
[2023-11-10 11:37:46,722 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 22 predicate places.
[2023-11-10 11:37:46,723 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 109 transitions, 474 flow
[2023-11-10 11:37:46,723 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 85.42857142857143) internal successors, (598), 7 states have internal predecessors, (598), 0 states have call successors, (0), 0 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:37:46,723 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:46,723 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]
[2023-11-10 11:37:46,723 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-10 11:37:46,723 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:46,724 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:46,724 INFO  L85        PathProgramCache]: Analyzing trace with hash 1760161530, now seen corresponding path program 1 times
[2023-11-10 11:37:46,724 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:46,724 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622002928]
[2023-11-10 11:37:46,724 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:46,724 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:46,744 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:46,864 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:37:46,865 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:46,865 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622002928]
[2023-11-10 11:37:46,865 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622002928] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:46,865 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:46,865 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2023-11-10 11:37:46,865 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099454468]
[2023-11-10 11:37:46,865 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:46,866 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-10 11:37:46,866 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:46,866 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-10 11:37:46,866 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2023-11-10 11:37:46,867 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2023-11-10 11:37:46,867 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 109 transitions, 474 flow. Second operand  has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 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:37:46,867 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:46,867 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2023-11-10 11:37:46,867 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:47,557 INFO  L124   PetriNetUnfolderBase]: 2954/5890 cut-off events.
[2023-11-10 11:37:47,557 INFO  L125   PetriNetUnfolderBase]: For 7055/8501 co-relation queries the response was YES.
[2023-11-10 11:37:47,580 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 14316 conditions, 5890 events. 2954/5890 cut-off events. For 7055/8501 co-relation queries the response was YES. Maximal size of possible extension queue 396. Compared 46968 event pairs, 210 based on Foata normal form. 45/5673 useless extension candidates. Maximal degree in co-relation 14231. Up to 1866 conditions per place. 
[2023-11-10 11:37:47,662 INFO  L140   encePairwiseOnDemand]: 106/116 looper letters, 84 selfloop transitions, 17 changer transitions 4/190 dead transitions.
[2023-11-10 11:37:47,662 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 190 transitions, 1074 flow
[2023-11-10 11:37:47,663 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-10 11:37:47,663 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-10 11:37:47,664 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 981 transitions.
[2023-11-10 11:37:47,665 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8456896551724138
[2023-11-10 11:37:47,665 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 981 transitions.
[2023-11-10 11:37:47,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 981 transitions.
[2023-11-10 11:37:47,665 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:47,665 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 981 transitions.
[2023-11-10 11:37:47,667 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 98.1) internal successors, (981), 10 states have internal predecessors, (981), 0 states have call successors, (0), 0 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:37:47,668 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:37:47,669 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:37:47,669 INFO  L175             Difference]: Start difference. First operand has 142 places, 109 transitions, 474 flow. Second operand 10 states and 981 transitions.
[2023-11-10 11:37:47,669 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 190 transitions, 1074 flow
[2023-11-10 11:37:47,680 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 190 transitions, 988 flow, removed 41 selfloop flow, removed 10 redundant places.
[2023-11-10 11:37:47,682 INFO  L231             Difference]: Finished difference. Result has 138 places, 124 transitions, 550 flow
[2023-11-10 11:37:47,682 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=550, PETRI_PLACES=138, PETRI_TRANSITIONS=124}
[2023-11-10 11:37:47,683 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 18 predicate places.
[2023-11-10 11:37:47,683 INFO  L495      AbstractCegarLoop]: Abstraction has has 138 places, 124 transitions, 550 flow
[2023-11-10 11:37:47,683 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 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:37:47,683 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:47,683 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]
[2023-11-10 11:37:47,684 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-10 11:37:47,684 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:47,684 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:47,684 INFO  L85        PathProgramCache]: Analyzing trace with hash 775066324, now seen corresponding path program 1 times
[2023-11-10 11:37:47,684 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:47,685 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361498794]
[2023-11-10 11:37:47,685 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:47,685 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:47,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:47,883 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:37:47,883 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:47,884 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361498794]
[2023-11-10 11:37:47,884 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361498794] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:47,884 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:47,884 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:37:47,884 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786999397]
[2023-11-10 11:37:47,884 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:47,884 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:37:47,885 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:47,885 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:37:47,885 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:37:47,886 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 88 out of 116
[2023-11-10 11:37:47,886 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 124 transitions, 550 flow. Second operand  has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:37:47,886 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:47,886 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 116
[2023-11-10 11:37:47,886 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:48,464 INFO  L124   PetriNetUnfolderBase]: 1201/4091 cut-off events.
[2023-11-10 11:37:48,464 INFO  L125   PetriNetUnfolderBase]: For 4856/5337 co-relation queries the response was YES.
[2023-11-10 11:37:48,483 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10620 conditions, 4091 events. 1201/4091 cut-off events. For 4856/5337 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42054 event pairs, 245 based on Foata normal form. 118/3970 useless extension candidates. Maximal degree in co-relation 10535. Up to 759 conditions per place. 
[2023-11-10 11:37:48,498 INFO  L140   encePairwiseOnDemand]: 110/116 looper letters, 60 selfloop transitions, 7 changer transitions 0/165 dead transitions.
[2023-11-10 11:37:48,498 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 165 transitions, 896 flow
[2023-11-10 11:37:48,499 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-11-10 11:37:48,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2023-11-10 11:37:48,500 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions.
[2023-11-10 11:37:48,501 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8275862068965517
[2023-11-10 11:37:48,501 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 672 transitions.
[2023-11-10 11:37:48,501 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions.
[2023-11-10 11:37:48,501 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:48,501 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions.
[2023-11-10 11:37:48,502 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 0 states have call successors, (0), 0 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:37:48,504 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:37:48,504 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 116.0) internal successors, (928), 8 states have internal predecessors, (928), 0 states have call successors, (0), 0 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:37:48,504 INFO  L175             Difference]: Start difference. First operand has 138 places, 124 transitions, 550 flow. Second operand 7 states and 672 transitions.
[2023-11-10 11:37:48,504 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 165 transitions, 896 flow
[2023-11-10 11:37:48,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 165 transitions, 876 flow, removed 9 selfloop flow, removed 7 redundant places.
[2023-11-10 11:37:48,522 INFO  L231             Difference]: Finished difference. Result has 142 places, 129 transitions, 611 flow
[2023-11-10 11:37:48,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=142, PETRI_TRANSITIONS=129}
[2023-11-10 11:37:48,525 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 22 predicate places.
[2023-11-10 11:37:48,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 129 transitions, 611 flow
[2023-11-10 11:37:48,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 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:37:48,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:48,526 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]
[2023-11-10 11:37:48,527 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-10 11:37:48,527 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:48,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:48,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 1052039668, now seen corresponding path program 2 times
[2023-11-10 11:37:48,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:48,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422872578]
[2023-11-10 11:37:48,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:48,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:48,565 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:48,690 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:37:48,690 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:48,690 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422872578]
[2023-11-10 11:37:48,690 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422872578] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:48,690 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:48,690 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2023-11-10 11:37:48,690 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55717890]
[2023-11-10 11:37:48,691 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:48,691 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2023-11-10 11:37:48,691 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:48,691 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2023-11-10 11:37:48,692 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2023-11-10 11:37:48,692 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2023-11-10 11:37:48,693 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 129 transitions, 611 flow. Second operand  has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 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:37:48,693 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:48,693 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2023-11-10 11:37:48,693 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:49,701 INFO  L124   PetriNetUnfolderBase]: 4151/8495 cut-off events.
[2023-11-10 11:37:49,701 INFO  L125   PetriNetUnfolderBase]: For 14371/15979 co-relation queries the response was YES.
[2023-11-10 11:37:49,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 26270 conditions, 8495 events. 4151/8495 cut-off events. For 14371/15979 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 75562 event pairs, 283 based on Foata normal form. 182/8441 useless extension candidates. Maximal degree in co-relation 26187. Up to 1424 conditions per place. 
[2023-11-10 11:37:49,743 INFO  L140   encePairwiseOnDemand]: 106/116 looper letters, 79 selfloop transitions, 32 changer transitions 34/232 dead transitions.
[2023-11-10 11:37:49,743 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 232 transitions, 1481 flow
[2023-11-10 11:37:49,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-10 11:37:49,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-10 11:37:49,746 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1278 transitions.
[2023-11-10 11:37:49,746 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8474801061007957
[2023-11-10 11:37:49,747 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1278 transitions.
[2023-11-10 11:37:49,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1278 transitions.
[2023-11-10 11:37:49,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:49,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1278 transitions.
[2023-11-10 11:37:49,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 98.3076923076923) internal successors, (1278), 13 states have internal predecessors, (1278), 0 states have call successors, (0), 0 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:37:49,751 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:49,751 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:49,751 INFO  L175             Difference]: Start difference. First operand has 142 places, 129 transitions, 611 flow. Second operand 13 states and 1278 transitions.
[2023-11-10 11:37:49,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 232 transitions, 1481 flow
[2023-11-10 11:37:49,798 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 232 transitions, 1478 flow, removed 1 selfloop flow, removed 1 redundant places.
[2023-11-10 11:37:49,800 INFO  L231             Difference]: Finished difference. Result has 157 places, 146 transitions, 825 flow
[2023-11-10 11:37:49,801 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=825, PETRI_PLACES=157, PETRI_TRANSITIONS=146}
[2023-11-10 11:37:49,801 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 37 predicate places.
[2023-11-10 11:37:49,801 INFO  L495      AbstractCegarLoop]: Abstraction has has 157 places, 146 transitions, 825 flow
[2023-11-10 11:37:49,801 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 91.14285714285714) internal successors, (638), 7 states have internal predecessors, (638), 0 states have call successors, (0), 0 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:37:49,802 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:49,802 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:37:49,802 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-10 11:37:49,802 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:49,802 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:49,802 INFO  L85        PathProgramCache]: Analyzing trace with hash -1764643654, now seen corresponding path program 1 times
[2023-11-10 11:37:49,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:49,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735252878]
[2023-11-10 11:37:49,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:49,806 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:49,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:50,000 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:37:50,000 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:50,000 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735252878]
[2023-11-10 11:37:50,001 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735252878] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:50,001 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:50,001 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-10 11:37:50,001 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189663694]
[2023-11-10 11:37:50,001 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:50,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-10 11:37:50,002 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:50,002 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-10 11:37:50,003 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2023-11-10 11:37:50,003 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 89 out of 116
[2023-11-10 11:37:50,004 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 146 transitions, 825 flow. Second operand  has 8 states, 8 states have (on average 91.25) internal successors, (730), 8 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:37:50,004 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:50,004 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 116
[2023-11-10 11:37:50,004 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:51,106 INFO  L124   PetriNetUnfolderBase]: 3904/8024 cut-off events.
[2023-11-10 11:37:51,107 INFO  L125   PetriNetUnfolderBase]: For 20379/21970 co-relation queries the response was YES.
[2023-11-10 11:37:51,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27890 conditions, 8024 events. 3904/8024 cut-off events. For 20379/21970 co-relation queries the response was YES. Maximal size of possible extension queue 603. Compared 72433 event pairs, 280 based on Foata normal form. 68/7856 useless extension candidates. Maximal degree in co-relation 27859. Up to 1265 conditions per place. 
[2023-11-10 11:37:51,146 INFO  L140   encePairwiseOnDemand]: 106/116 looper letters, 51 selfloop transitions, 28 changer transitions 62/228 dead transitions.
[2023-11-10 11:37:51,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 228 transitions, 1583 flow
[2023-11-10 11:37:51,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-11-10 11:37:51,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2023-11-10 11:37:51,149 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1534 transitions.
[2023-11-10 11:37:51,150 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8265086206896551
[2023-11-10 11:37:51,150 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1534 transitions.
[2023-11-10 11:37:51,150 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1534 transitions.
[2023-11-10 11:37:51,151 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:51,151 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1534 transitions.
[2023-11-10 11:37:51,153 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 95.875) internal successors, (1534), 16 states have internal predecessors, (1534), 0 states have call successors, (0), 0 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:37:51,155 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 0 states have call successors, (0), 0 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:37:51,156 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 116.0) internal successors, (1972), 17 states have internal predecessors, (1972), 0 states have call successors, (0), 0 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:37:51,156 INFO  L175             Difference]: Start difference. First operand has 157 places, 146 transitions, 825 flow. Second operand 16 states and 1534 transitions.
[2023-11-10 11:37:51,156 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 228 transitions, 1583 flow
[2023-11-10 11:37:51,520 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 228 transitions, 1413 flow, removed 68 selfloop flow, removed 11 redundant places.
[2023-11-10 11:37:51,522 INFO  L231             Difference]: Finished difference. Result has 165 places, 137 transitions, 721 flow
[2023-11-10 11:37:51,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=721, PETRI_PLACES=165, PETRI_TRANSITIONS=137}
[2023-11-10 11:37:51,523 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 45 predicate places.
[2023-11-10 11:37:51,523 INFO  L495      AbstractCegarLoop]: Abstraction has has 165 places, 137 transitions, 721 flow
[2023-11-10 11:37:51,524 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 91.25) internal successors, (730), 8 states have internal predecessors, (730), 0 states have call successors, (0), 0 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:37:51,524 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:51,524 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]
[2023-11-10 11:37:51,524 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-10 11:37:51,524 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:51,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:51,524 INFO  L85        PathProgramCache]: Analyzing trace with hash -106077437, now seen corresponding path program 1 times
[2023-11-10 11:37:51,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:51,524 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803139936]
[2023-11-10 11:37:51,525 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:51,525 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:51,558 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:51,975 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:37:51,975 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:51,975 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803139936]
[2023-11-10 11:37:51,975 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803139936] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:51,975 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:51,975 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2023-11-10 11:37:51,975 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957439804]
[2023-11-10 11:37:51,975 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:51,976 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2023-11-10 11:37:51,976 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:51,976 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2023-11-10 11:37:51,976 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2023-11-10 11:37:51,977 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 79 out of 116
[2023-11-10 11:37:51,977 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 137 transitions, 721 flow. Second operand  has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:51,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:51,978 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 116
[2023-11-10 11:37:51,978 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:52,642 INFO  L124   PetriNetUnfolderBase]: 761/4269 cut-off events.
[2023-11-10 11:37:52,642 INFO  L125   PetriNetUnfolderBase]: For 9273/9591 co-relation queries the response was YES.
[2023-11-10 11:37:52,654 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12562 conditions, 4269 events. 761/4269 cut-off events. For 9273/9591 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 54690 event pairs, 39 based on Foata normal form. 16/4085 useless extension candidates. Maximal degree in co-relation 12464. Up to 489 conditions per place. 
[2023-11-10 11:37:52,658 INFO  L140   encePairwiseOnDemand]: 96/116 looper letters, 37 selfloop transitions, 35 changer transitions 37/202 dead transitions.
[2023-11-10 11:37:52,658 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 202 transitions, 1429 flow
[2023-11-10 11:37:52,659 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2023-11-10 11:37:52,659 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2023-11-10 11:37:52,660 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 874 transitions.
[2023-11-10 11:37:52,660 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.753448275862069
[2023-11-10 11:37:52,660 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 874 transitions.
[2023-11-10 11:37:52,660 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 874 transitions.
[2023-11-10 11:37:52,661 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:52,661 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 874 transitions.
[2023-11-10 11:37:52,662 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 87.4) internal successors, (874), 10 states have internal predecessors, (874), 0 states have call successors, (0), 0 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:37:52,664 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:37:52,664 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 116.0) internal successors, (1276), 11 states have internal predecessors, (1276), 0 states have call successors, (0), 0 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:37:52,664 INFO  L175             Difference]: Start difference. First operand has 165 places, 137 transitions, 721 flow. Second operand 10 states and 874 transitions.
[2023-11-10 11:37:52,664 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 202 transitions, 1429 flow
[2023-11-10 11:37:52,759 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 202 transitions, 1240 flow, removed 76 selfloop flow, removed 14 redundant places.
[2023-11-10 11:37:52,762 INFO  L231             Difference]: Finished difference. Result has 164 places, 151 transitions, 831 flow
[2023-11-10 11:37:52,763 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=831, PETRI_PLACES=164, PETRI_TRANSITIONS=151}
[2023-11-10 11:37:52,764 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 44 predicate places.
[2023-11-10 11:37:52,764 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 151 transitions, 831 flow
[2023-11-10 11:37:52,764 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 8 states, 8 states have (on average 82.625) internal successors, (661), 8 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:52,764 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:52,764 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]
[2023-11-10 11:37:52,764 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-10 11:37:52,764 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:52,765 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:52,765 INFO  L85        PathProgramCache]: Analyzing trace with hash -1625379391, now seen corresponding path program 2 times
[2023-11-10 11:37:52,765 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:52,765 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078546251]
[2023-11-10 11:37:52,765 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:52,765 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:52,803 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-10 11:37:53,356 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:37:53,357 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-10 11:37:53,357 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078546251]
[2023-11-10 11:37:53,357 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078546251] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-10 11:37:53,357 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-10 11:37:53,357 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2023-11-10 11:37:53,357 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20889569]
[2023-11-10 11:37:53,357 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-10 11:37:53,358 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2023-11-10 11:37:53,358 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-10 11:37:53,358 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2023-11-10 11:37:53,358 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110
[2023-11-10 11:37:53,359 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 75 out of 116
[2023-11-10 11:37:53,359 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 151 transitions, 831 flow. Second operand  has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 0 states have call successors, (0), 0 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:37:53,359 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-10 11:37:53,359 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 116
[2023-11-10 11:37:53,359 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-10 11:37:53,857 INFO  L124   PetriNetUnfolderBase]: 407/2480 cut-off events.
[2023-11-10 11:37:53,858 INFO  L125   PetriNetUnfolderBase]: For 3592/3671 co-relation queries the response was YES.
[2023-11-10 11:37:53,867 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6958 conditions, 2480 events. 407/2480 cut-off events. For 3592/3671 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 28631 event pairs, 20 based on Foata normal form. 5/2362 useless extension candidates. Maximal degree in co-relation 6926. Up to 279 conditions per place. 
[2023-11-10 11:37:53,871 INFO  L140   encePairwiseOnDemand]: 96/116 looper letters, 42 selfloop transitions, 27 changer transitions 21/179 dead transitions.
[2023-11-10 11:37:53,871 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 179 transitions, 1171 flow
[2023-11-10 11:37:53,871 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2023-11-10 11:37:53,871 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2023-11-10 11:37:53,873 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1050 transitions.
[2023-11-10 11:37:53,873 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6962864721485411
[2023-11-10 11:37:53,873 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1050 transitions.
[2023-11-10 11:37:53,873 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1050 transitions.
[2023-11-10 11:37:53,874 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-10 11:37:53,874 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1050 transitions.
[2023-11-10 11:37:53,875 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 80.76923076923077) internal successors, (1050), 13 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-10 11:37:53,877 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:53,877 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 116.0) internal successors, (1624), 14 states have internal predecessors, (1624), 0 states have call successors, (0), 0 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:37:53,877 INFO  L175             Difference]: Start difference. First operand has 164 places, 151 transitions, 831 flow. Second operand 13 states and 1050 transitions.
[2023-11-10 11:37:53,877 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 179 transitions, 1171 flow
[2023-11-10 11:37:53,911 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 179 transitions, 1133 flow, removed 12 selfloop flow, removed 5 redundant places.
[2023-11-10 11:37:53,913 INFO  L231             Difference]: Finished difference. Result has 172 places, 146 transitions, 824 flow
[2023-11-10 11:37:53,913 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=116, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=824, PETRI_PLACES=172, PETRI_TRANSITIONS=146}
[2023-11-10 11:37:53,914 INFO  L281   CegarLoopForPetriNet]: 120 programPoint places, 52 predicate places.
[2023-11-10 11:37:53,914 INFO  L495      AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 824 flow
[2023-11-10 11:37:53,915 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 78.0) internal successors, (858), 11 states have internal predecessors, (858), 0 states have call successors, (0), 0 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:37:53,915 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-10 11:37:53,915 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:37:53,915 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-10 11:37:53,915 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2023-11-10 11:37:53,915 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-10 11:37:53,915 INFO  L85        PathProgramCache]: Analyzing trace with hash 1159135395, now seen corresponding path program 3 times
[2023-11-10 11:37:53,915 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-10 11:37:53,915 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295719972]
[2023-11-10 11:37:53,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-10 11:37:53,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-10 11:37:53,941 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:37:53,941 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-10 11:37:53,972 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-10 11:37:54,015 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-10 11:37:54,015 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-10 11:37:54,016 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2023-11-10 11:37:54,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2023-11-10 11:37:54,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2023-11-10 11:37:54,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2023-11-10 11:37:54,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2023-11-10 11:37:54,018 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2023-11-10 11:37:54,018 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-10 11:37:54,019 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1]
[2023-11-10 11:37:54,024 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-10 11:37:54,024 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-10 11:37:54,088 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-10 11:37:54,089 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-10 11:37:54,090 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-10 11:37:54,104 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 11:37:54 BasicIcfg
[2023-11-10 11:37:54,105 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-10 11:37:54,105 INFO  L158              Benchmark]: Toolchain (without parser) took 13132.21ms. Allocated memory was 192.9MB in the beginning and 1.1GB in the end (delta: 931.1MB). Free memory was 132.9MB in the beginning and 292.1MB in the end (delta: -159.3MB). Peak memory consumption was 773.2MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,105 INFO  L158              Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-11-10 11:37:54,105 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 446.82ms. Allocated memory was 192.9MB in the beginning and 362.8MB in the end (delta: 169.9MB). Free memory was 132.7MB in the beginning and 328.8MB in the end (delta: -196.1MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,106 INFO  L158              Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 362.8MB. Free memory was 328.8MB in the beginning and 326.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,106 INFO  L158              Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 362.8MB. Free memory was 326.2MB in the beginning and 324.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,106 INFO  L158              Benchmark]: RCFGBuilder took 579.78ms. Allocated memory is still 362.8MB. Free memory was 324.1MB in the beginning and 286.3MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,106 INFO  L158              Benchmark]: TraceAbstraction took 12040.55ms. Allocated memory was 362.8MB in the beginning and 1.1GB in the end (delta: 761.3MB). Free memory was 285.8MB in the beginning and 292.1MB in the end (delta: -6.3MB). Peak memory consumption was 755.4MB. Max. memory is 8.0GB.
[2023-11-10 11:37:54,107 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.12ms. Allocated memory is still 192.9MB. Free memory is still 145.2MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 446.82ms. Allocated memory was 192.9MB in the beginning and 362.8MB in the end (delta: 169.9MB). Free memory was 132.7MB in the beginning and 328.8MB in the end (delta: -196.1MB). Peak memory consumption was 29.3MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 362.8MB. Free memory was 328.8MB in the beginning and 326.2MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 21.53ms. Allocated memory is still 362.8MB. Free memory was 326.2MB in the beginning and 324.6MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * RCFGBuilder took 579.78ms. Allocated memory is still 362.8MB. Free memory was 324.1MB in the beginning and 286.3MB in the end (delta: 37.8MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB.
 * TraceAbstraction took 12040.55ms. Allocated memory was 362.8MB in the beginning and 1.1GB in the end (delta: 761.3MB). Free memory was 285.8MB in the beginning and 292.1MB in the end (delta: -6.3MB). Peak memory consumption was 755.4MB. 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
    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: 
[L709]               0  int __unbuffered_cnt = 0;
        VAL             [__unbuffered_cnt=0]
[L711]               0  int __unbuffered_p1_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0]
[L713]               0  int __unbuffered_p1_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0]
[L715]               0  int __unbuffered_p2_EAX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0]
[L717]               0  int __unbuffered_p2_EBX = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L718]               0  _Bool main$tmp_guard0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0]
[L719]               0  _Bool main$tmp_guard1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L721]               0  int x = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L723]               0  int y = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L725]               0  int z = 0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L726]               0  _Bool z$flush_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z=0]
[L727]               0  int z$mem_tmp;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z=0]
[L728]               0  _Bool z$r_buff0_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z=0]
[L729]               0  _Bool z$r_buff0_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z=0]
[L730]               0  _Bool z$r_buff0_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z=0]
[L731]               0  _Bool z$r_buff0_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z=0]
[L732]               0  _Bool z$r_buff1_thd0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z=0]
[L733]               0  _Bool z$r_buff1_thd1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z=0]
[L734]               0  _Bool z$r_buff1_thd2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z=0]
[L735]               0  _Bool z$r_buff1_thd3;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z=0]
[L736]               0  _Bool z$read_delayed;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z=0]
[L737]               0  int *z$read_delayed_var;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z=0]
[L738]               0  int z$w_buff0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z=0]
[L739]               0  _Bool z$w_buff0_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z=0]
[L740]               0  int z$w_buff1;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z=0]
[L741]               0  _Bool z$w_buff1_used;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L742]               0  _Bool weak$$choice0;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L743]               0  _Bool weak$$choice2;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L843]               0  pthread_t t153;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L844]  FCALL, FORK  0  pthread_create(&t153, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L845]               0  pthread_t t154;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L846]  FCALL, FORK  0  pthread_create(&t154, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L847]               0  pthread_t t155;
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L848]  FCALL, FORK  0  pthread_create(&t155, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L747]               1  z$w_buff1 = z$w_buff0
[L748]               1  z$w_buff0 = 1
[L749]               1  z$w_buff1_used = z$w_buff0_used
[L750]               1  z$w_buff0_used = (_Bool)1
[L751]  CALL         1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L18]   COND FALSE   1  !(!expression)
[L751]  RET          1  __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used))
[L752]               1  z$r_buff1_thd0 = z$r_buff0_thd0
[L753]               1  z$r_buff1_thd1 = z$r_buff0_thd1
[L754]               1  z$r_buff1_thd2 = z$r_buff0_thd2
[L755]               1  z$r_buff1_thd3 = z$r_buff0_thd3
[L756]               1  z$r_buff0_thd1 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L759]               1  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L776]               2  x = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L779]               2  __unbuffered_p1_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L782]               2  __unbuffered_p1_EBX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L799]               3  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L802]               3  __unbuffered_p2_EAX = y
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L785]               2  z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)
[L786]               2  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used
[L787]               2  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used
[L788]               2  z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2
[L789]               2  z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L805]               3  weak$$choice0 = __VERIFIER_nondet_bool()
[L806]               3  weak$$choice2 = __VERIFIER_nondet_bool()
[L807]               3  z$flush_delayed = weak$$choice2
[L808]               3  z$mem_tmp = z
[L809]               3  z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)
[L810]               3  z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))
[L811]               3  z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))
[L812]               3  z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))
[L813]               3  z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L814]               3  z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))
[L815]               3  z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L816]               3  __unbuffered_p2_EBX = z
[L817]               3  z = z$flush_delayed ? z$mem_tmp : z
[L818]               3  z$flush_delayed = (_Bool)0
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L821]               3  z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z)
[L822]               3  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used
[L823]               3  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used
[L824]               3  z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3
[L825]               3  z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0]
[L762]               1  z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z)
[L763]               1  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used
[L764]               1  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used
[L765]               1  z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1
[L766]               1  z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1
        VAL             [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L769]               1  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L792]               2  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L828]               3  __unbuffered_cnt = __unbuffered_cnt + 1
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L850]               0  main$tmp_guard0 = __unbuffered_cnt == 3
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L852]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
        VAL             [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L852]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L854]               0  z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z)
[L855]               0  z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used
[L856]               0  z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used
[L857]               0  z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0
[L858]               0  z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L861]               0  main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
        VAL             [__unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L863]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
        VAL             [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]
[L18]                0  reach_error()
        VAL             [\old(expression)=0, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1]

  - 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: 848]: 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: 844]: 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: 846]: 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 7 procedures, 144 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 11.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 778 mSDsluCounter, 835 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 650 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1602 IncrementalHoareTripleChecker+Invalid, 1652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 185 mSDtfsCounter, 1602 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=831occurred in iteration=9, InterpolantAutomatonStates: 107, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 845 NumberOfCodeBlocks, 845 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 747 ConstructedInterpolants, 0 QuantifiedInterpolants, 4104 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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:37:54,132 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...