/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf --rcfgbuilder.only.consider.context.switches.at.boundaries.of.atomic.blocks true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i


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


This is Ultimate 0.2.3-wip.dk.datarace-free-lbe-02cf818-m
[2023-11-17 11:25:42,402 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-11-17 11:25:42,486 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf
[2023-11-17 11:25:42,521 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-11-17 11:25:42,522 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-11-17 11:25:42,522 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-11-17 11:25:42,523 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-11-17 11:25:42,523 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-11-17 11:25:42,524 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-11-17 11:25:42,527 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-11-17 11:25:42,528 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-11-17 11:25:42,528 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-11-17 11:25:42,528 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-11-17 11:25:42,529 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-11-17 11:25:42,530 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-11-17 11:25:42,530 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-11-17 11:25:42,530 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-11-17 11:25:42,530 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-11-17 11:25:42,531 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-11-17 11:25:42,531 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-11-17 11:25:42,531 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-11-17 11:25:42,532 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-11-17 11:25:42,532 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-11-17 11:25:42,532 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-11-17 11:25:42,533 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-11-17 11:25:42,534 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 11:25:42,534 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-11-17 11:25:42,534 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-11-17 11:25:42,534 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2023-11-17 11:25:42,535 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-11-17 11:25:42,535 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-11-17 11:25:42,536 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2023-11-17 11:25:42,536 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Only consider context switches at boundaries of atomic blocks -> true
[2023-11-17 11:25:42,741 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-11-17 11:25:42,761 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-11-17 11:25:42,764 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-11-17 11:25:42,765 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-11-17 11:25:42,766 INFO  L274        PluginConnector]: CDTParser initialized
[2023-11-17 11:25:42,767 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i
[2023-11-17 11:25:43,985 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-11-17 11:25:44,263 INFO  L384              CDTParser]: Found 1 translation units.
[2023-11-17 11:25:44,264 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix029_power.opt_pso.opt_rmo.opt.i
[2023-11-17 11:25:44,287 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0196013ff/237839c34b1946fd8aebede6e466cdc3/FLAGbc8e1a19c
[2023-11-17 11:25:44,305 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0196013ff/237839c34b1946fd8aebede6e466cdc3
[2023-11-17 11:25:44,307 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-11-17 11:25:44,309 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-11-17 11:25:44,312 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-11-17 11:25:44,312 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-11-17 11:25:44,315 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-11-17 11:25:44,316 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,317 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@130163dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44, skipping insertion in model container
[2023-11-17 11:25:44,317 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,368 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2023-11-17 11:25:44,506 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979]
[2023-11-17 11:25:44,707 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 11:25:44,717 INFO  L202         MainTranslator]: Completed pre-run
[2023-11-17 11:25:44,730 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/mix029_power.opt_pso.opt_rmo.opt.i[966,979]
[2023-11-17 11:25:44,774 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-11-17 11:25:44,813 WARN  L675               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 11:25:44,813 WARN  L675               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-11-17 11:25:44,820 INFO  L206         MainTranslator]: Completed translation
[2023-11-17 11:25:44,820 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44 WrapperNode
[2023-11-17 11:25:44,820 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-11-17 11:25:44,821 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-11-17 11:25:44,821 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-11-17 11:25:44,821 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-11-17 11:25:44,828 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,855 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,899 INFO  L138                Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 160
[2023-11-17 11:25:44,899 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-11-17 11:25:44,900 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-11-17 11:25:44,900 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-11-17 11:25:44,900 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-11-17 11:25:44,909 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,909 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,920 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,920 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,932 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,935 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,937 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,938 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,941 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-11-17 11:25:44,942 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-11-17 11:25:44,942 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-11-17 11:25:44,942 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-11-17 11:25:44,943 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (1/1) ...
[2023-11-17 11:25:44,947 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-11-17 11:25:44,965 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-11-17 11:25:44,982 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-11-17 11:25:44,992 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-11-17 11:25:45,008 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure P0
[2023-11-17 11:25:45,009 INFO  L138     BoogieDeclarations]: Found implementation of procedure P0
[2023-11-17 11:25:45,009 INFO  L130     BoogieDeclarations]: Found specification of procedure P1
[2023-11-17 11:25:45,010 INFO  L138     BoogieDeclarations]: Found implementation of procedure P1
[2023-11-17 11:25:45,010 INFO  L130     BoogieDeclarations]: Found specification of procedure P2
[2023-11-17 11:25:45,010 INFO  L138     BoogieDeclarations]: Found implementation of procedure P2
[2023-11-17 11:25:45,010 INFO  L130     BoogieDeclarations]: Found specification of procedure P3
[2023-11-17 11:25:45,010 INFO  L138     BoogieDeclarations]: Found implementation of procedure P3
[2023-11-17 11:25:45,010 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-11-17 11:25:45,010 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-11-17 11:25:45,011 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-11-17 11:25:45,011 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-11-17 11:25:45,012 WARN  L211             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-11-17 11:25:45,145 INFO  L239             CfgBuilder]: Building ICFG
[2023-11-17 11:25:45,147 INFO  L265             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-11-17 11:25:45,416 INFO  L280             CfgBuilder]: Performing block encoding
[2023-11-17 11:25:45,630 INFO  L302             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-11-17 11:25:45,630 INFO  L307             CfgBuilder]: Removed 0 assume(true) statements.
[2023-11-17 11:25:45,631 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:45 BoogieIcfgContainer
[2023-11-17 11:25:45,631 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-11-17 11:25:45,634 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-11-17 11:25:45,634 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-11-17 11:25:45,637 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-11-17 11:25:45,637 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 11:25:44" (1/3) ...
[2023-11-17 11:25:45,637 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e75b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:45, skipping insertion in model container
[2023-11-17 11:25:45,638 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 11:25:44" (2/3) ...
[2023-11-17 11:25:45,638 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14e75b16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 11:25:45, skipping insertion in model container
[2023-11-17 11:25:45,638 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.11 11:25:45" (3/3) ...
[2023-11-17 11:25:45,641 INFO  L112   eAbstractionObserver]: Analyzing ICFG mix029_power.opt_pso.opt_rmo.opt.i
[2023-11-17 11:25:45,655 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-11-17 11:25:45,655 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2023-11-17 11:25:45,655 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-11-17 11:25:45,706 INFO  L144    ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2023-11-17 11:25:45,744 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 61 places, 49 transitions, 114 flow
[2023-11-17 11:25:45,779 INFO  L124   PetriNetUnfolderBase]: 1/45 cut-off events.
[2023-11-17 11:25:45,779 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:45,784 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. 
[2023-11-17 11:25:45,784 INFO  L82        GeneralOperation]: Start removeDead. Operand has 61 places, 49 transitions, 114 flow
[2023-11-17 11:25:45,788 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 57 places, 45 transitions, 102 flow
[2023-11-17 11:25:45,794 INFO  L115   etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation.
[2023-11-17 11:25:45,808 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 57 places, 45 transitions, 102 flow
[2023-11-17 11:25:45,811 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 57 places, 45 transitions, 102 flow
[2023-11-17 11:25:45,811 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 57 places, 45 transitions, 102 flow
[2023-11-17 11:25:45,824 INFO  L124   PetriNetUnfolderBase]: 1/45 cut-off events.
[2023-11-17 11:25:45,824 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:45,825 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 58 conditions, 45 events. 1/45 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 100 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. 
[2023-11-17 11:25:45,826 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1226
[2023-11-17 11:25:47,370 INFO  L134        LiptonReduction]: Checked pairs total: 3125
[2023-11-17 11:25:47,370 INFO  L136        LiptonReduction]: Total number of compositions: 21
[2023-11-17 11:25:47,389 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-11-17 11:25:47,396 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;@724baea5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-11-17 11:25:47,396 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2023-11-17 11:25:47,403 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2023-11-17 11:25:47,403 INFO  L124   PetriNetUnfolderBase]: 0/13 cut-off events.
[2023-11-17 11:25:47,403 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2023-11-17 11:25:47,404 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:47,404 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:47,404 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:47,408 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:47,409 INFO  L85        PathProgramCache]: Analyzing trace with hash 1665814578, now seen corresponding path program 1 times
[2023-11-17 11:25:47,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:47,417 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136272664]
[2023-11-17 11:25:47,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:47,418 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:47,537 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:47,789 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:47,789 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:47,789 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136272664]
[2023-11-17 11:25:47,790 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136272664] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:47,790 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:47,790 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 11:25:47,791 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550836162]
[2023-11-17 11:25:47,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:47,800 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:47,804 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:47,826 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:47,826 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:47,827 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 25 out of 70
[2023-11-17 11:25:47,829 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand  has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:47,829 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:47,829 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 70
[2023-11-17 11:25:47,830 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:48,550 INFO  L124   PetriNetUnfolderBase]: 2855/4235 cut-off events.
[2023-11-17 11:25:48,551 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2023-11-17 11:25:48,560 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8311 conditions, 4235 events. 2855/4235 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 23749 event pairs, 545 based on Foata normal form. 0/4003 useless extension candidates. Maximal degree in co-relation 8299. Up to 3103 conditions per place. 
[2023-11-17 11:25:48,580 INFO  L140   encePairwiseOnDemand]: 67/70 looper letters, 33 selfloop transitions, 2 changer transitions 2/42 dead transitions.
[2023-11-17 11:25:48,580 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 173 flow
[2023-11-17 11:25:48,581 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:48,583 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:48,590 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions.
[2023-11-17 11:25:48,592 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5380952380952381
[2023-11-17 11:25:48,592 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 113 transitions.
[2023-11-17 11:25:48,593 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 113 transitions.
[2023-11-17 11:25:48,594 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:48,596 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 113 transitions.
[2023-11-17 11:25:48,599 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:48,603 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:48,603 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:48,604 INFO  L175             Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 3 states and 113 transitions.
[2023-11-17 11:25:48,605 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 173 flow
[2023-11-17 11:25:48,609 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 168 flow, removed 0 selfloop flow, removed 4 redundant places.
[2023-11-17 11:25:48,611 INFO  L231             Difference]: Finished difference. Result has 39 places, 27 transitions, 66 flow
[2023-11-17 11:25:48,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=39, PETRI_TRANSITIONS=27}
[2023-11-17 11:25:48,615 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, -3 predicate places.
[2023-11-17 11:25:48,615 INFO  L495      AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 66 flow
[2023-11-17 11:25:48,616 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:48,616 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:48,616 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:48,616 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-11-17 11:25:48,617 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:48,624 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:48,624 INFO  L85        PathProgramCache]: Analyzing trace with hash 340413322, now seen corresponding path program 1 times
[2023-11-17 11:25:48,624 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:48,624 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103384143]
[2023-11-17 11:25:48,624 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:48,624 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:48,685 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:49,830 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:49,830 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:49,830 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103384143]
[2023-11-17 11:25:49,830 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103384143] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:49,831 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:49,831 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:25:49,831 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641812445]
[2023-11-17 11:25:49,831 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:49,832 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:25:49,833 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:49,833 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:25:49,833 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:25:49,834 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70
[2023-11-17 11:25:49,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 66 flow. Second operand  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:49,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:49,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70
[2023-11-17 11:25:49,835 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:50,945 INFO  L124   PetriNetUnfolderBase]: 7805/10574 cut-off events.
[2023-11-17 11:25:50,946 INFO  L125   PetriNetUnfolderBase]: For 468/468 co-relation queries the response was YES.
[2023-11-17 11:25:50,974 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 21882 conditions, 10574 events. 7805/10574 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 338. Compared 47645 event pairs, 2349 based on Foata normal form. 280/10854 useless extension candidates. Maximal degree in co-relation 21872. Up to 6845 conditions per place. 
[2023-11-17 11:25:51,030 INFO  L140   encePairwiseOnDemand]: 60/70 looper letters, 44 selfloop transitions, 9 changer transitions 0/53 dead transitions.
[2023-11-17 11:25:51,030 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 53 transitions, 226 flow
[2023-11-17 11:25:51,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:51,031 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:51,032 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions.
[2023-11-17 11:25:51,032 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.46785714285714286
[2023-11-17 11:25:51,032 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 131 transitions.
[2023-11-17 11:25:51,032 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 131 transitions.
[2023-11-17 11:25:51,033 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:51,033 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 131 transitions.
[2023-11-17 11:25:51,034 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:51,035 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:51,035 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:51,035 INFO  L175             Difference]: Start difference. First operand has 39 places, 27 transitions, 66 flow. Second operand 4 states and 131 transitions.
[2023-11-17 11:25:51,035 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 53 transitions, 226 flow
[2023-11-17 11:25:51,038 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 53 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:51,039 INFO  L231             Difference]: Finished difference. Result has 42 places, 34 transitions, 130 flow
[2023-11-17 11:25:51,040 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=130, PETRI_PLACES=42, PETRI_TRANSITIONS=34}
[2023-11-17 11:25:51,040 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 0 predicate places.
[2023-11-17 11:25:51,041 INFO  L495      AbstractCegarLoop]: Abstraction has has 42 places, 34 transitions, 130 flow
[2023-11-17 11:25:51,041 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:51,041 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:51,041 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:51,041 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2023-11-17 11:25:51,042 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:51,042 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:51,042 INFO  L85        PathProgramCache]: Analyzing trace with hash 716635220, now seen corresponding path program 1 times
[2023-11-17 11:25:51,042 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:51,042 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096001093]
[2023-11-17 11:25:51,043 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:51,043 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:51,066 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:51,423 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:51,424 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:51,424 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096001093]
[2023-11-17 11:25:51,425 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096001093] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:51,425 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:51,425 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1
[2023-11-17 11:25:51,425 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628398323]
[2023-11-17 11:25:51,425 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:51,429 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:25:51,429 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:51,430 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:25:51,430 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:25:51,430 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70
[2023-11-17 11:25:51,431 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 34 transitions, 130 flow. Second operand  has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:51,431 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:51,431 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70
[2023-11-17 11:25:51,431 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:52,384 INFO  L124   PetriNetUnfolderBase]: 5627/8100 cut-off events.
[2023-11-17 11:25:52,384 INFO  L125   PetriNetUnfolderBase]: For 2768/2919 co-relation queries the response was YES.
[2023-11-17 11:25:52,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20781 conditions, 8100 events. 5627/8100 cut-off events. For 2768/2919 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 43996 event pairs, 1827 based on Foata normal form. 38/7772 useless extension candidates. Maximal degree in co-relation 20768. Up to 6570 conditions per place. 
[2023-11-17 11:25:52,444 INFO  L140   encePairwiseOnDemand]: 66/70 looper letters, 38 selfloop transitions, 3 changer transitions 0/48 dead transitions.
[2023-11-17 11:25:52,444 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 48 transitions, 248 flow
[2023-11-17 11:25:52,444 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:25:52,445 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:25:52,445 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions.
[2023-11-17 11:25:52,446 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5238095238095238
[2023-11-17 11:25:52,446 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 110 transitions.
[2023-11-17 11:25:52,446 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 110 transitions.
[2023-11-17 11:25:52,446 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:52,446 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 110 transitions.
[2023-11-17 11:25:52,447 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:52,448 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:52,448 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:52,448 INFO  L175             Difference]: Start difference. First operand has 42 places, 34 transitions, 130 flow. Second operand 3 states and 110 transitions.
[2023-11-17 11:25:52,448 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 48 transitions, 248 flow
[2023-11-17 11:25:52,453 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 246 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:52,454 INFO  L231             Difference]: Finished difference. Result has 44 places, 36 transitions, 147 flow
[2023-11-17 11:25:52,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=147, PETRI_PLACES=44, PETRI_TRANSITIONS=36}
[2023-11-17 11:25:52,456 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places.
[2023-11-17 11:25:52,456 INFO  L495      AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 147 flow
[2023-11-17 11:25:52,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:52,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:52,456 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:52,457 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2023-11-17 11:25:52,457 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:52,457 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:52,458 INFO  L85        PathProgramCache]: Analyzing trace with hash -204584268, now seen corresponding path program 1 times
[2023-11-17 11:25:52,458 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:52,458 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902882733]
[2023-11-17 11:25:52,458 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:52,458 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:52,499 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:53,018 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:53,018 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:53,018 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902882733]
[2023-11-17 11:25:53,018 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902882733] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:53,019 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:53,019 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:25:53,019 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032003031]
[2023-11-17 11:25:53,019 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:53,019 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:25:53,020 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:53,020 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:25:53,020 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:25:53,021 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70
[2023-11-17 11:25:53,021 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 147 flow. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:53,021 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:53,021 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70
[2023-11-17 11:25:53,022 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:53,836 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L864-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_136 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_144 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_260 256) 0)) (.cse1 (and .cse6 .cse8)) (.cse2 (and .cse8 (= (mod v_~y$w_buff1_used~0_238 256) 0)))) (let ((.cse10 (or .cse12 .cse1 .cse2)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse5 (= (mod v_~y$w_buff1_used~0_237 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_259 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_70 256) 0))) (.cse7 (ite .cse10 v_~y~0_193 (ite .cse11 v_~y$w_buff0~0_154 v_~y$w_buff1~0_144)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|) (= v_~y$w_buff1~0_144 v_~y$w_buff1~0_143) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42| 0) (= 0 v_~y$flush_delayed~0_71) (= v_~y$w_buff1_used~0_237 (ite .cse0 v_~y$w_buff1_used~0_238 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_238 0))) (= v_~y~0_193 v_~y$mem_tmp~0_56) (= v_~y$r_buff1_thd0~0_135 (ite .cse0 v_~y$r_buff1_thd0~0_136 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_143 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd0~0_136 0))) (= v_~y~0_192 (ite .cse0 v_~y$mem_tmp~0_56 .cse7)) (= v_~y$r_buff0_thd0~0_143 (ite .cse0 v_~y$r_buff0_thd0~0_144 (ite (or .cse1 (and .cse5 .cse8) .cse3) v_~y$r_buff0_thd0~0_144 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd0~0_144)))) (= v_~y$w_buff0_used~0_259 (ite .cse0 v_~y$w_buff0_used~0_260 (ite .cse10 v_~y$w_buff0_used~0_260 (ite .cse11 0 v_~y$w_buff0_used~0_260)))) (= v_~y$w_buff0~0_154 v_~y$w_buff0~0_153) (= (ite (= (ite (not (and (= .cse7 2) (= v_~__unbuffered_p0_EAX~0_58 0) (= 2 v_~__unbuffered_p3_EAX~0_58) (= 0 v_~__unbuffered_p3_EBX~0_58) (= v_~z~0_72 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62))))))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_260, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_154, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_193, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_238}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_259, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_62|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1~0=v_~y$w_buff1~0_143, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_143, ~y$w_buff0~0=v_~y$w_buff0~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_71, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_192, ~weak$$choice2~0=v_~weak$$choice2~0_70, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_237}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][54], [26#L819true, 33#P2EXITtrue, Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 71#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 43#L769true, 81#true, Black: 78#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), P3Thread1of1ForFork0InUse, 76#true, P0Thread1of1ForFork3InUse, 45#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P2Thread1of1ForFork2InUse, 68#true, P1Thread1of1ForFork1InUse, 23#L754true])
[2023-11-17 11:25:53,837 INFO  L294   olderBase$Statistics]: this new event has 21 ancestors and is cut-off event
[2023-11-17 11:25:53,837 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:53,837 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:53,837 INFO  L297   olderBase$Statistics]:   existing Event has 21 ancestors and is cut-off event
[2023-11-17 11:25:53,911 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L864-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_136 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_144 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_260 256) 0)) (.cse1 (and .cse6 .cse8)) (.cse2 (and .cse8 (= (mod v_~y$w_buff1_used~0_238 256) 0)))) (let ((.cse10 (or .cse12 .cse1 .cse2)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse5 (= (mod v_~y$w_buff1_used~0_237 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_259 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_70 256) 0))) (.cse7 (ite .cse10 v_~y~0_193 (ite .cse11 v_~y$w_buff0~0_154 v_~y$w_buff1~0_144)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|) (= v_~y$w_buff1~0_144 v_~y$w_buff1~0_143) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42| 0) (= 0 v_~y$flush_delayed~0_71) (= v_~y$w_buff1_used~0_237 (ite .cse0 v_~y$w_buff1_used~0_238 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_238 0))) (= v_~y~0_193 v_~y$mem_tmp~0_56) (= v_~y$r_buff1_thd0~0_135 (ite .cse0 v_~y$r_buff1_thd0~0_136 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_143 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd0~0_136 0))) (= v_~y~0_192 (ite .cse0 v_~y$mem_tmp~0_56 .cse7)) (= v_~y$r_buff0_thd0~0_143 (ite .cse0 v_~y$r_buff0_thd0~0_144 (ite (or .cse1 (and .cse5 .cse8) .cse3) v_~y$r_buff0_thd0~0_144 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd0~0_144)))) (= v_~y$w_buff0_used~0_259 (ite .cse0 v_~y$w_buff0_used~0_260 (ite .cse10 v_~y$w_buff0_used~0_260 (ite .cse11 0 v_~y$w_buff0_used~0_260)))) (= v_~y$w_buff0~0_154 v_~y$w_buff0~0_153) (= (ite (= (ite (not (and (= .cse7 2) (= v_~__unbuffered_p0_EAX~0_58 0) (= 2 v_~__unbuffered_p3_EAX~0_58) (= 0 v_~__unbuffered_p3_EBX~0_58) (= v_~z~0_72 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62))))))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_260, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_154, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_193, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_238}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_259, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_62|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1~0=v_~y$w_buff1~0_143, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_143, ~y$w_buff0~0=v_~y$w_buff0~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_71, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_192, ~weak$$choice2~0=v_~weak$$choice2~0_70, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_237}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][54], [26#L819true, 33#P2EXITtrue, Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 71#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 81#true, Black: 78#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), P3Thread1of1ForFork0InUse, 76#true, 31#L776true, P0Thread1of1ForFork3InUse, 45#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P2Thread1of1ForFork2InUse, 68#true, P1Thread1of1ForFork1InUse, 23#L754true])
[2023-11-17 11:25:53,912 INFO  L294   olderBase$Statistics]: this new event has 22 ancestors and is cut-off event
[2023-11-17 11:25:53,912 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:53,912 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:53,912 INFO  L297   olderBase$Statistics]:   existing Event has 22 ancestors and is cut-off event
[2023-11-17 11:25:53,963 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([433] L864-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (let ((.cse6 (= (mod v_~y$r_buff1_thd0~0_136 256) 0)) (.cse8 (= (mod v_~y$r_buff0_thd0~0_144 256) 0))) (let ((.cse9 (not .cse8)) (.cse12 (= (mod v_~y$w_buff0_used~0_260 256) 0)) (.cse1 (and .cse6 .cse8)) (.cse2 (and .cse8 (= (mod v_~y$w_buff1_used~0_238 256) 0)))) (let ((.cse10 (or .cse12 .cse1 .cse2)) (.cse11 (and .cse9 (not .cse12)))) (let ((.cse5 (= (mod v_~y$w_buff1_used~0_237 256) 0)) (.cse3 (= (mod v_~y$w_buff0_used~0_259 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_70 256) 0))) (.cse7 (ite .cse10 v_~y~0_193 (ite .cse11 v_~y$w_buff0~0_154 v_~y$w_buff1~0_144)))) (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38| |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|) (= v_~y$w_buff1~0_144 v_~y$w_buff1~0_143) (= (mod v_~main$tmp_guard1~0_62 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|) (= |v_ULTIMATE.start___VERIFIER_assert_~expression#1_42| 0) (= 0 v_~y$flush_delayed~0_71) (= v_~y$w_buff1_used~0_237 (ite .cse0 v_~y$w_buff1_used~0_238 (ite (or .cse1 .cse2 .cse3) v_~y$w_buff1_used~0_238 0))) (= v_~y~0_193 v_~y$mem_tmp~0_56) (= v_~y$r_buff1_thd0~0_135 (ite .cse0 v_~y$r_buff1_thd0~0_136 (ite (let ((.cse4 (= (mod v_~y$r_buff0_thd0~0_143 256) 0))) (or .cse3 (and .cse4 .cse5) (and .cse4 .cse6))) v_~y$r_buff1_thd0~0_136 0))) (= v_~y~0_192 (ite .cse0 v_~y$mem_tmp~0_56 .cse7)) (= v_~y$r_buff0_thd0~0_143 (ite .cse0 v_~y$r_buff0_thd0~0_144 (ite (or .cse1 (and .cse5 .cse8) .cse3) v_~y$r_buff0_thd0~0_144 (ite (and .cse9 (not .cse3)) 0 v_~y$r_buff0_thd0~0_144)))) (= v_~y$w_buff0_used~0_259 (ite .cse0 v_~y$w_buff0_used~0_260 (ite .cse10 v_~y$w_buff0_used~0_260 (ite .cse11 0 v_~y$w_buff0_used~0_260)))) (= v_~y$w_buff0~0_154 v_~y$w_buff0~0_153) (= (ite (= (ite (not (and (= .cse7 2) (= v_~__unbuffered_p0_EAX~0_58 0) (= 2 v_~__unbuffered_p3_EAX~0_58) (= 0 v_~__unbuffered_p3_EBX~0_58) (= v_~z~0_72 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_62))))))  InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_260, ~y$w_buff1~0=v_~y$w_buff1~0_144, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_144, ~y$w_buff0~0=v_~y$w_buff0~0_154, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_193, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_136, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_238}  OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_42|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_259, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_58, ULTIMATE.start_main_#t~nondet12#1=|v_ULTIMATE.start_main_#t~nondet12#1_62|, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$mem_tmp~0=v_~y$mem_tmp~0_56, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_58, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_54|, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_38|, ~y$w_buff1~0=v_~y$w_buff1~0_143, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_143, ~y$w_buff0~0=v_~y$w_buff0~0_153, ~y$flush_delayed~0=v_~y$flush_delayed~0_71, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_58, ~z~0=v_~z~0_72, ~y~0=v_~y~0_192, ~weak$$choice2~0=v_~weak$$choice2~0_70, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_135, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_237}  AuxVars[]  AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~nondet12#1, ~weak$$choice0~0, ~y$mem_tmp~0, ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ~y$w_buff1~0, ~y$r_buff0_thd0~0, ~y$w_buff0~0, ~y$flush_delayed~0, ~y~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][54], [26#L819true, 18#P1EXITtrue, 33#P2EXITtrue, Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 71#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 81#true, Black: 78#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), P3Thread1of1ForFork0InUse, 76#true, P0Thread1of1ForFork3InUse, 45#ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTIONtrue, P2Thread1of1ForFork2InUse, 68#true, P1Thread1of1ForFork1InUse, 23#L754true])
[2023-11-17 11:25:53,963 INFO  L294   olderBase$Statistics]: this new event has 23 ancestors and is cut-off event
[2023-11-17 11:25:53,963 INFO  L297   olderBase$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-11-17 11:25:53,964 INFO  L297   olderBase$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-11-17 11:25:53,964 INFO  L297   olderBase$Statistics]:   existing Event has 23 ancestors and is cut-off event
[2023-11-17 11:25:54,021 INFO  L124   PetriNetUnfolderBase]: 5722/8243 cut-off events.
[2023-11-17 11:25:54,021 INFO  L125   PetriNetUnfolderBase]: For 4354/4586 co-relation queries the response was YES.
[2023-11-17 11:25:54,043 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22323 conditions, 8243 events. 5722/8243 cut-off events. For 4354/4586 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 45202 event pairs, 1742 based on Foata normal form. 124/8058 useless extension candidates. Maximal degree in co-relation 22308. Up to 6268 conditions per place. 
[2023-11-17 11:25:54,075 INFO  L140   encePairwiseOnDemand]: 64/70 looper letters, 48 selfloop transitions, 8 changer transitions 0/63 dead transitions.
[2023-11-17 11:25:54,075 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 63 transitions, 343 flow
[2023-11-17 11:25:54,076 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:54,076 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:54,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 146 transitions.
[2023-11-17 11:25:54,077 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5214285714285715
[2023-11-17 11:25:54,077 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 146 transitions.
[2023-11-17 11:25:54,077 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 146 transitions.
[2023-11-17 11:25:54,077 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:54,077 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 146 transitions.
[2023-11-17 11:25:54,078 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:54,079 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:54,079 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:54,079 INFO  L175             Difference]: Start difference. First operand has 44 places, 36 transitions, 147 flow. Second operand 4 states and 146 transitions.
[2023-11-17 11:25:54,079 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 63 transitions, 343 flow
[2023-11-17 11:25:54,083 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:25:54,083 INFO  L231             Difference]: Finished difference. Result has 47 places, 41 transitions, 202 flow
[2023-11-17 11:25:54,084 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=47, PETRI_TRANSITIONS=41}
[2023-11-17 11:25:54,084 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 5 predicate places.
[2023-11-17 11:25:54,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 47 places, 41 transitions, 202 flow
[2023-11-17 11:25:54,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:54,085 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:54,085 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:54,085 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2023-11-17 11:25:54,085 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:54,086 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:54,086 INFO  L85        PathProgramCache]: Analyzing trace with hash 32664905, now seen corresponding path program 1 times
[2023-11-17 11:25:54,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:54,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312156541]
[2023-11-17 11:25:54,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:54,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:54,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:54,860 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:54,860 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:54,861 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312156541]
[2023-11-17 11:25:54,861 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312156541] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:54,861 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:54,861 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:25:54,861 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143364727]
[2023-11-17 11:25:54,861 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:54,862 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:25:54,862 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:54,862 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:25:54,862 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:25:54,863 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70
[2023-11-17 11:25:54,863 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 41 transitions, 202 flow. Second operand  has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:54,863 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:54,863 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70
[2023-11-17 11:25:54,863 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:56,389 INFO  L124   PetriNetUnfolderBase]: 10973/15046 cut-off events.
[2023-11-17 11:25:56,390 INFO  L125   PetriNetUnfolderBase]: For 11579/11579 co-relation queries the response was YES.
[2023-11-17 11:25:56,426 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 45529 conditions, 15046 events. 10973/15046 cut-off events. For 11579/11579 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 75556 event pairs, 2957 based on Foata normal form. 144/15190 useless extension candidates. Maximal degree in co-relation 45512. Up to 7676 conditions per place. 
[2023-11-17 11:25:56,471 INFO  L140   encePairwiseOnDemand]: 57/70 looper letters, 85 selfloop transitions, 36 changer transitions 18/139 dead transitions.
[2023-11-17 11:25:56,472 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 139 transitions, 918 flow
[2023-11-17 11:25:56,472 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-17 11:25:56,472 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-17 11:25:56,473 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 212 transitions.
[2023-11-17 11:25:56,473 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5047619047619047
[2023-11-17 11:25:56,474 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 212 transitions.
[2023-11-17 11:25:56,474 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 212 transitions.
[2023-11-17 11:25:56,474 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:56,474 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 212 transitions.
[2023-11-17 11:25:56,475 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 35.333333333333336) internal successors, (212), 6 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:56,476 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:56,476 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:56,476 INFO  L175             Difference]: Start difference. First operand has 47 places, 41 transitions, 202 flow. Second operand 6 states and 212 transitions.
[2023-11-17 11:25:56,476 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 139 transitions, 918 flow
[2023-11-17 11:25:56,485 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 139 transitions, 882 flow, removed 3 selfloop flow, removed 2 redundant places.
[2023-11-17 11:25:56,487 INFO  L231             Difference]: Finished difference. Result has 53 places, 70 transitions, 495 flow
[2023-11-17 11:25:56,487 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=495, PETRI_PLACES=53, PETRI_TRANSITIONS=70}
[2023-11-17 11:25:56,488 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 11 predicate places.
[2023-11-17 11:25:56,488 INFO  L495      AbstractCegarLoop]: Abstraction has has 53 places, 70 transitions, 495 flow
[2023-11-17 11:25:56,488 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:56,488 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:56,488 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:56,488 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2023-11-17 11:25:56,489 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:56,489 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:56,489 INFO  L85        PathProgramCache]: Analyzing trace with hash -2074589097, now seen corresponding path program 1 times
[2023-11-17 11:25:56,489 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:56,489 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796365241]
[2023-11-17 11:25:56,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:56,490 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:56,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:56,867 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:56,867 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:56,867 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796365241]
[2023-11-17 11:25:56,867 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796365241] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:56,867 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:56,868 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:25:56,871 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606826568]
[2023-11-17 11:25:56,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:56,872 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:25:56,872 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:56,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:25:56,873 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:25:56,874 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70
[2023-11-17 11:25:56,874 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 70 transitions, 495 flow. Second operand  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:56,874 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:56,874 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70
[2023-11-17 11:25:56,874 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:58,092 INFO  L124   PetriNetUnfolderBase]: 8159/11940 cut-off events.
[2023-11-17 11:25:58,092 INFO  L125   PetriNetUnfolderBase]: For 23468/23805 co-relation queries the response was YES.
[2023-11-17 11:25:58,142 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44225 conditions, 11940 events. 8159/11940 cut-off events. For 23468/23805 co-relation queries the response was YES. Maximal size of possible extension queue 556. Compared 69279 event pairs, 1374 based on Foata normal form. 249/11807 useless extension candidates. Maximal degree in co-relation 44205. Up to 8855 conditions per place. 
[2023-11-17 11:25:58,198 INFO  L140   encePairwiseOnDemand]: 66/70 looper letters, 77 selfloop transitions, 7 changer transitions 0/101 dead transitions.
[2023-11-17 11:25:58,199 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 101 transitions, 798 flow
[2023-11-17 11:25:58,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:25:58,200 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:25:58,200 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions.
[2023-11-17 11:25:58,200 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5178571428571429
[2023-11-17 11:25:58,200 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 145 transitions.
[2023-11-17 11:25:58,201 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 145 transitions.
[2023-11-17 11:25:58,201 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:58,201 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 145 transitions.
[2023-11-17 11:25:58,201 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:58,202 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:58,202 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:58,202 INFO  L175             Difference]: Start difference. First operand has 53 places, 70 transitions, 495 flow. Second operand 4 states and 145 transitions.
[2023-11-17 11:25:58,203 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 101 transitions, 798 flow
[2023-11-17 11:25:58,270 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 101 transitions, 798 flow, removed 0 selfloop flow, removed 0 redundant places.
[2023-11-17 11:25:58,272 INFO  L231             Difference]: Finished difference. Result has 57 places, 70 transitions, 514 flow
[2023-11-17 11:25:58,272 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=514, PETRI_PLACES=57, PETRI_TRANSITIONS=70}
[2023-11-17 11:25:58,275 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 15 predicate places.
[2023-11-17 11:25:58,275 INFO  L495      AbstractCegarLoop]: Abstraction has has 57 places, 70 transitions, 514 flow
[2023-11-17 11:25:58,275 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 26.8) internal successors, (134), 5 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:58,275 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:25:58,276 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:25:58,276 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-11-17 11:25:58,276 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:25:58,276 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:25:58,276 INFO  L85        PathProgramCache]: Analyzing trace with hash 607604435, now seen corresponding path program 1 times
[2023-11-17 11:25:58,277 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:25:58,277 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190407054]
[2023-11-17 11:25:58,277 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:25:58,277 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:25:58,304 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:25:58,786 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:25:58,786 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:25:58,786 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190407054]
[2023-11-17 11:25:58,786 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190407054] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:25:58,786 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:25:58,787 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:25:58,787 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778549384]
[2023-11-17 11:25:58,787 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:25:58,787 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-17 11:25:58,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:25:58,788 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-17 11:25:58,788 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-11-17 11:25:58,788 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 24 out of 70
[2023-11-17 11:25:58,789 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 70 transitions, 514 flow. Second operand  has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:58,789 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:25:58,789 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 70
[2023-11-17 11:25:58,789 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:25:59,877 INFO  L124   PetriNetUnfolderBase]: 8951/12949 cut-off events.
[2023-11-17 11:25:59,877 INFO  L125   PetriNetUnfolderBase]: For 29204/29944 co-relation queries the response was YES.
[2023-11-17 11:25:59,916 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49709 conditions, 12949 events. 8951/12949 cut-off events. For 29204/29944 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 75364 event pairs, 1017 based on Foata normal form. 263/12744 useless extension candidates. Maximal degree in co-relation 49686. Up to 8588 conditions per place. 
[2023-11-17 11:25:59,973 INFO  L140   encePairwiseOnDemand]: 62/70 looper letters, 107 selfloop transitions, 45 changer transitions 2/171 dead transitions.
[2023-11-17 11:25:59,973 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 171 transitions, 1396 flow
[2023-11-17 11:25:59,974 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2023-11-17 11:25:59,974 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2023-11-17 11:25:59,975 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 285 transitions.
[2023-11-17 11:25:59,975 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5089285714285714
[2023-11-17 11:25:59,975 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 285 transitions.
[2023-11-17 11:25:59,975 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 285 transitions.
[2023-11-17 11:25:59,976 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:25:59,976 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 285 transitions.
[2023-11-17 11:25:59,977 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 35.625) internal successors, (285), 8 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:59,978 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:59,978 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 70.0) internal successors, (630), 9 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:25:59,978 INFO  L175             Difference]: Start difference. First operand has 57 places, 70 transitions, 514 flow. Second operand 8 states and 285 transitions.
[2023-11-17 11:25:59,978 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 171 transitions, 1396 flow
[2023-11-17 11:26:00,061 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 171 transitions, 1372 flow, removed 4 selfloop flow, removed 2 redundant places.
[2023-11-17 11:26:00,065 INFO  L231             Difference]: Finished difference. Result has 65 places, 104 transitions, 939 flow
[2023-11-17 11:26:00,066 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=499, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=939, PETRI_PLACES=65, PETRI_TRANSITIONS=104}
[2023-11-17 11:26:00,066 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 23 predicate places.
[2023-11-17 11:26:00,067 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 104 transitions, 939 flow
[2023-11-17 11:26:00,067 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:00,067 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:00,067 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:00,067 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-11-17 11:26:00,068 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:00,068 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:00,068 INFO  L85        PathProgramCache]: Analyzing trace with hash -2116523622, now seen corresponding path program 1 times
[2023-11-17 11:26:00,068 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:00,068 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089037000]
[2023-11-17 11:26:00,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:00,069 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:00,086 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:00,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:00,907 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:00,907 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089037000]
[2023-11-17 11:26:00,908 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089037000] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:00,908 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:00,908 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:26:00,908 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243502732]
[2023-11-17 11:26:00,908 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:00,908 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:26:00,909 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:00,909 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:26:00,909 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:26:00,909 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 19 out of 70
[2023-11-17 11:26:00,909 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 104 transitions, 939 flow. Second operand  has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:00,909 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:00,909 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 70
[2023-11-17 11:26:00,909 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:02,439 INFO  L124   PetriNetUnfolderBase]: 15076/20843 cut-off events.
[2023-11-17 11:26:02,440 INFO  L125   PetriNetUnfolderBase]: For 52530/52530 co-relation queries the response was YES.
[2023-11-17 11:26:02,487 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 83384 conditions, 20843 events. 15076/20843 cut-off events. For 52530/52530 co-relation queries the response was YES. Maximal size of possible extension queue 738. Compared 112093 event pairs, 3849 based on Foata normal form. 216/21059 useless extension candidates. Maximal degree in co-relation 83358. Up to 10848 conditions per place. 
[2023-11-17 11:26:02,539 INFO  L140   encePairwiseOnDemand]: 62/70 looper letters, 103 selfloop transitions, 18 changer transitions 26/147 dead transitions.
[2023-11-17 11:26:02,539 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 147 transitions, 1480 flow
[2023-11-17 11:26:02,540 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:26:02,540 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:26:02,540 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 137 transitions.
[2023-11-17 11:26:02,540 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48928571428571427
[2023-11-17 11:26:02,540 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 137 transitions.
[2023-11-17 11:26:02,541 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 137 transitions.
[2023-11-17 11:26:02,541 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:02,541 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 137 transitions.
[2023-11-17 11:26:02,541 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 34.25) internal successors, (137), 4 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:02,542 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:02,542 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:02,542 INFO  L175             Difference]: Start difference. First operand has 65 places, 104 transitions, 939 flow. Second operand 4 states and 137 transitions.
[2023-11-17 11:26:02,542 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 147 transitions, 1480 flow
[2023-11-17 11:26:02,833 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 147 transitions, 1450 flow, removed 15 selfloop flow, removed 0 redundant places.
[2023-11-17 11:26:02,835 INFO  L231             Difference]: Finished difference. Result has 70 places, 88 transitions, 755 flow
[2023-11-17 11:26:02,836 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=755, PETRI_PLACES=70, PETRI_TRANSITIONS=88}
[2023-11-17 11:26:02,836 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 28 predicate places.
[2023-11-17 11:26:02,836 INFO  L495      AbstractCegarLoop]: Abstraction has has 70 places, 88 transitions, 755 flow
[2023-11-17 11:26:02,837 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:02,837 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:02,837 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:02,837 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2023-11-17 11:26:02,837 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:02,837 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:02,838 INFO  L85        PathProgramCache]: Analyzing trace with hash -313976257, now seen corresponding path program 1 times
[2023-11-17 11:26:02,838 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:02,838 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618563314]
[2023-11-17 11:26:02,838 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:02,838 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:02,871 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:02,958 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:02,958 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:02,958 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618563314]
[2023-11-17 11:26:02,958 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618563314] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:02,958 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:02,958 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-11-17 11:26:02,959 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193213636]
[2023-11-17 11:26:02,959 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:02,959 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2023-11-17 11:26:02,959 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:02,960 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2023-11-17 11:26:02,960 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2023-11-17 11:26:02,960 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70
[2023-11-17 11:26:02,960 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 88 transitions, 755 flow. Second operand  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:02,960 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:02,960 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70
[2023-11-17 11:26:02,960 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:03,725 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([343] L858-->L864: Formula: (let ((.cse1 (not (= (mod v_~y$r_buff1_thd0~0_68 256) 0))) (.cse0 (not (= (mod v_~y$w_buff0_used~0_123 256) 0))) (.cse5 (not (= (mod v_~y$r_buff0_thd0~0_76 256) 0)))) (let ((.cse3 (and .cse0 .cse5)) (.cse2 (and .cse1 (not (= (mod v_~y$w_buff1_used~0_117 256) 0)))) (.cse4 (and .cse5 (not (= (mod v_~y$w_buff0_used~0_124 256) 0))))) (and (= (ite (or (and .cse0 (not (= (mod v_~y$r_buff0_thd0~0_75 256) 0))) (and .cse1 (not (= (mod v_~y$w_buff1_used~0_116 256) 0)))) 0 v_~y$r_buff1_thd0~0_68) v_~y$r_buff1_thd0~0_67) (= (ite (or .cse2 .cse3) 0 v_~y$w_buff1_used~0_117) v_~y$w_buff1_used~0_116) (= (ite .cse3 0 v_~y$r_buff0_thd0~0_76) v_~y$r_buff0_thd0~0_75) (= v_~y~0_81 (ite .cse4 v_~y$w_buff0~0_47 (ite .cse2 v_~y$w_buff1~0_52 v_~y~0_82))) (= (ite .cse4 0 v_~y$w_buff0_used~0_124) v_~y$w_buff0_used~0_123))))  InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_124, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_76, ~y$w_buff0~0=v_~y$w_buff0~0_47, ~y~0=v_~y~0_82, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_68, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_117}  OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_123, ~y$w_buff1~0=v_~y$w_buff1~0_52, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_75, ~y$w_buff0~0=v_~y$w_buff0~0_47, ~y~0=v_~y~0_81, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_67, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_116}  AuxVars[]  AssignedVars[~y$w_buff0_used~0, ~y$r_buff0_thd0~0, ~y~0, ~y$r_buff1_thd0~0, ~y$w_buff1_used~0][79], [111#true, Black: 128#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), 18#P1EXITtrue, Black: 127#(= ~z~0 1), Black: 70#(= ~__unbuffered_p3_EAX~0 0), Black: 71#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 78#(and (= ~y$w_buff1~0 0) (= ~y~0 0) (= ~y$w_buff0~0 0)), 39#L864true, Black: 84#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y~0 0) (= ~y$r_buff1_thd0~0 0)), 68#true, 23#L754true, 132#true, 26#L819true, 99#(and (= ~__unbuffered_p0_EAX~0 1) (= ~x~0 1)), Black: 96#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0))) (= ~x~0 1)), Black: 94#(and (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))) (not (= 2 ~y$w_buff1~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0)) (not (= 2 ~z~0)) (and (or (not (= (* 256 (div ~y$w_buff1_used~0 256)) ~y$w_buff1_used~0)) (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0))) (or (not (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0)) (not (= ~y$r_buff1_thd0~0 (* 256 (div ~y$r_buff1_thd0~0 256))))) (not (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256)))))) (or (not (= 2 ~__unbuffered_p3_EAX~0)) (= ~y$w_buff0_used~0 (* 256 (div ~y$w_buff0_used~0 256))) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~y$w_buff0~0)) (not (= ~__unbuffered_p0_EAX~0 0)) (= (* 256 (div ~y$r_buff0_thd0~0 256)) ~y$r_buff0_thd0~0) (not (= 2 ~z~0)))), Black: 107#(and (= ~y$w_buff0_used~0 0) (<= 0 ~y$w_buff1_used~0) (<= ~y$w_buff1_used~0 (* 256 (div ~y$w_buff1_used~0 256))) (= ~y~0 1)), 125#true, P3Thread1of1ForFork0InUse, Black: 116#(and (= ~y$r_buff0_thd0~0 0) (or (= ~y~0 0) (= ~y~0 1)) (= ~y$r_buff1_thd0~0 0)), 13#L796true, P0Thread1of1ForFork3InUse, Black: 115#(and (= ~y$w_buff1~0 0) (= ~y$r_buff0_thd0~0 0) (= ~y$r_buff1_thd0~0 0) (= ~y~0 1)), Black: 114#(and (= ~y$r_buff0_thd0~0 0) (= ~y$w_buff0~0 0) (= ~y~0 1)), P2Thread1of1ForFork2InUse, P1Thread1of1ForFork1InUse])
[2023-11-17 11:26:03,726 INFO  L294   olderBase$Statistics]: this new event has 19 ancestors and is not cut-off event
[2023-11-17 11:26:03,726 INFO  L297   olderBase$Statistics]:   existing Event has 19 ancestors and is not cut-off event
[2023-11-17 11:26:03,726 INFO  L297   olderBase$Statistics]:   existing Event has 19 ancestors and is not cut-off event
[2023-11-17 11:26:03,726 INFO  L297   olderBase$Statistics]:   existing Event has 19 ancestors and is not cut-off event
[2023-11-17 11:26:04,125 INFO  L124   PetriNetUnfolderBase]: 7241/11007 cut-off events.
[2023-11-17 11:26:04,125 INFO  L125   PetriNetUnfolderBase]: For 41918/42756 co-relation queries the response was YES.
[2023-11-17 11:26:04,169 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 44794 conditions, 11007 events. 7241/11007 cut-off events. For 41918/42756 co-relation queries the response was YES. Maximal size of possible extension queue 744. Compared 71026 event pairs, 1974 based on Foata normal form. 495/10808 useless extension candidates. Maximal degree in co-relation 44764. Up to 8785 conditions per place. 
[2023-11-17 11:26:04,206 INFO  L140   encePairwiseOnDemand]: 64/70 looper letters, 108 selfloop transitions, 5 changer transitions 7/139 dead transitions.
[2023-11-17 11:26:04,206 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 139 transitions, 1400 flow
[2023-11-17 11:26:04,207 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2023-11-17 11:26:04,207 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2023-11-17 11:26:04,207 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 100 transitions.
[2023-11-17 11:26:04,208 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.47619047619047616
[2023-11-17 11:26:04,208 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 100 transitions.
[2023-11-17 11:26:04,208 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 100 transitions.
[2023-11-17 11:26:04,208 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:04,208 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 100 transitions.
[2023-11-17 11:26:04,209 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:04,213 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:04,214 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 70.0) internal successors, (280), 4 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:04,214 INFO  L175             Difference]: Start difference. First operand has 70 places, 88 transitions, 755 flow. Second operand 3 states and 100 transitions.
[2023-11-17 11:26:04,214 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 139 transitions, 1400 flow
[2023-11-17 11:26:04,288 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 139 transitions, 1373 flow, removed 4 selfloop flow, removed 1 redundant places.
[2023-11-17 11:26:04,293 INFO  L231             Difference]: Finished difference. Result has 72 places, 90 transitions, 744 flow
[2023-11-17 11:26:04,293 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=744, PETRI_PLACES=72, PETRI_TRANSITIONS=90}
[2023-11-17 11:26:04,294 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places.
[2023-11-17 11:26:04,294 INFO  L495      AbstractCegarLoop]: Abstraction has has 72 places, 90 transitions, 744 flow
[2023-11-17 11:26:04,294 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:04,294 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:04,294 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:04,295 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2023-11-17 11:26:04,295 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:04,295 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:04,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 2055345824, now seen corresponding path program 2 times
[2023-11-17 11:26:04,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:04,295 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379401979]
[2023-11-17 11:26:04,295 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:04,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:04,328 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:04,540 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:04,540 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:04,540 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379401979]
[2023-11-17 11:26:04,541 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379401979] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:04,541 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:04,541 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2023-11-17 11:26:04,542 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916925015]
[2023-11-17 11:26:04,542 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:04,542 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2023-11-17 11:26:04,542 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:04,543 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2023-11-17 11:26:04,543 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2023-11-17 11:26:04,543 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70
[2023-11-17 11:26:04,544 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 90 transitions, 744 flow. Second operand  has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:04,544 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:04,544 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70
[2023-11-17 11:26:04,544 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:05,392 INFO  L124   PetriNetUnfolderBase]: 3811/6178 cut-off events.
[2023-11-17 11:26:05,392 INFO  L125   PetriNetUnfolderBase]: For 21104/21524 co-relation queries the response was YES.
[2023-11-17 11:26:05,412 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 27109 conditions, 6178 events. 3811/6178 cut-off events. For 21104/21524 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 39519 event pairs, 526 based on Foata normal form. 622/6540 useless extension candidates. Maximal degree in co-relation 27077. Up to 2973 conditions per place. 
[2023-11-17 11:26:05,426 INFO  L140   encePairwiseOnDemand]: 64/70 looper letters, 126 selfloop transitions, 9 changer transitions 18/171 dead transitions.
[2023-11-17 11:26:05,427 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 171 transitions, 1706 flow
[2023-11-17 11:26:05,427 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2023-11-17 11:26:05,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2023-11-17 11:26:05,428 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions.
[2023-11-17 11:26:05,428 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48214285714285715
[2023-11-17 11:26:05,429 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 135 transitions.
[2023-11-17 11:26:05,429 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 135 transitions.
[2023-11-17 11:26:05,429 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:05,429 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 135 transitions.
[2023-11-17 11:26:05,430 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:05,430 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:05,430 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 70.0) internal successors, (350), 5 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:05,430 INFO  L175             Difference]: Start difference. First operand has 72 places, 90 transitions, 744 flow. Second operand 4 states and 135 transitions.
[2023-11-17 11:26:05,431 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 171 transitions, 1706 flow
[2023-11-17 11:26:05,483 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 171 transitions, 1701 flow, removed 0 selfloop flow, removed 1 redundant places.
[2023-11-17 11:26:05,486 INFO  L231             Difference]: Finished difference. Result has 75 places, 90 transitions, 751 flow
[2023-11-17 11:26:05,486 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=751, PETRI_PLACES=75, PETRI_TRANSITIONS=90}
[2023-11-17 11:26:05,487 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2023-11-17 11:26:05,487 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 90 transitions, 751 flow
[2023-11-17 11:26:05,487 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:05,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:05,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:05,487 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2023-11-17 11:26:05,488 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:05,488 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:05,488 INFO  L85        PathProgramCache]: Analyzing trace with hash -2071978358, now seen corresponding path program 1 times
[2023-11-17 11:26:05,488 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:05,488 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361445420]
[2023-11-17 11:26:05,489 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:05,489 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:05,518 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:05,630 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:05,631 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:05,631 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361445420]
[2023-11-17 11:26:05,631 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361445420] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:05,631 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:05,631 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:26:05,631 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860923507]
[2023-11-17 11:26:05,632 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:05,632 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:26:05,632 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:05,633 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:26:05,633 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:26:05,633 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70
[2023-11-17 11:26:05,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 90 transitions, 751 flow. Second operand  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:05,635 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:05,635 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70
[2023-11-17 11:26:05,635 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:06,222 INFO  L124   PetriNetUnfolderBase]: 2693/4399 cut-off events.
[2023-11-17 11:26:06,222 INFO  L125   PetriNetUnfolderBase]: For 15862/16091 co-relation queries the response was YES.
[2023-11-17 11:26:06,237 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 20469 conditions, 4399 events. 2693/4399 cut-off events. For 15862/16091 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 26965 event pairs, 311 based on Foata normal form. 393/4630 useless extension candidates. Maximal degree in co-relation 20435. Up to 1681 conditions per place. 
[2023-11-17 11:26:06,247 INFO  L140   encePairwiseOnDemand]: 64/70 looper letters, 127 selfloop transitions, 13 changer transitions 22/177 dead transitions.
[2023-11-17 11:26:06,247 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 177 transitions, 1759 flow
[2023-11-17 11:26:06,248 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-11-17 11:26:06,248 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2023-11-17 11:26:06,249 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 168 transitions.
[2023-11-17 11:26:06,249 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.48
[2023-11-17 11:26:06,249 INFO  L72            ComplementDD]: Start complementDD. Operand 5 states and 168 transitions.
[2023-11-17 11:26:06,249 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 5 states and 168 transitions.
[2023-11-17 11:26:06,249 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:06,249 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 168 transitions.
[2023-11-17 11:26:06,250 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 6 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:06,250 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:06,251 INFO  L81            ComplementDD]: Finished complementDD. Result  has 6 states, 6 states have (on average 70.0) internal successors, (420), 6 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:06,251 INFO  L175             Difference]: Start difference. First operand has 75 places, 90 transitions, 751 flow. Second operand 5 states and 168 transitions.
[2023-11-17 11:26:06,251 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 177 transitions, 1759 flow
[2023-11-17 11:26:06,276 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 177 transitions, 1688 flow, removed 7 selfloop flow, removed 5 redundant places.
[2023-11-17 11:26:06,278 INFO  L231             Difference]: Finished difference. Result has 75 places, 84 transitions, 676 flow
[2023-11-17 11:26:06,278 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=690, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=676, PETRI_PLACES=75, PETRI_TRANSITIONS=84}
[2023-11-17 11:26:06,279 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 33 predicate places.
[2023-11-17 11:26:06,279 INFO  L495      AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 676 flow
[2023-11-17 11:26:06,279 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:06,279 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:06,279 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]
[2023-11-17 11:26:06,280 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2023-11-17 11:26:06,280 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:06,280 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:06,280 INFO  L85        PathProgramCache]: Analyzing trace with hash -1096573605, now seen corresponding path program 1 times
[2023-11-17 11:26:06,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:06,280 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681831553]
[2023-11-17 11:26:06,280 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:06,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:06,307 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:07,177 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:07,177 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:07,177 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681831553]
[2023-11-17 11:26:07,177 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681831553] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:07,177 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:07,178 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2023-11-17 11:26:07,178 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269917324]
[2023-11-17 11:26:07,178 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:07,178 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-11-17 11:26:07,178 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:07,179 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-11-17 11:26:07,179 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2023-11-17 11:26:07,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 18 out of 70
[2023-11-17 11:26:07,179 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 676 flow. Second operand  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:07,179 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:07,179 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 70
[2023-11-17 11:26:07,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:07,951 INFO  L124   PetriNetUnfolderBase]: 4809/7506 cut-off events.
[2023-11-17 11:26:07,952 INFO  L125   PetriNetUnfolderBase]: For 26654/26654 co-relation queries the response was YES.
[2023-11-17 11:26:07,968 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 34565 conditions, 7506 events. 4809/7506 cut-off events. For 26654/26654 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 43471 event pairs, 753 based on Foata normal form. 12/7518 useless extension candidates. Maximal degree in co-relation 34533. Up to 4099 conditions per place. 
[2023-11-17 11:26:07,977 INFO  L140   encePairwiseOnDemand]: 60/70 looper letters, 119 selfloop transitions, 36 changer transitions 81/236 dead transitions.
[2023-11-17 11:26:07,977 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 236 transitions, 2301 flow
[2023-11-17 11:26:07,978 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-17 11:26:07,978 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-17 11:26:07,978 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 204 transitions.
[2023-11-17 11:26:07,978 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4857142857142857
[2023-11-17 11:26:07,979 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 204 transitions.
[2023-11-17 11:26:07,979 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 204 transitions.
[2023-11-17 11:26:07,979 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:07,979 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 204 transitions.
[2023-11-17 11:26:07,979 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 34.0) internal successors, (204), 6 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:07,980 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:07,980 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:07,980 INFO  L175             Difference]: Start difference. First operand has 75 places, 84 transitions, 676 flow. Second operand 6 states and 204 transitions.
[2023-11-17 11:26:07,980 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 236 transitions, 2301 flow
[2023-11-17 11:26:08,067 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 236 transitions, 2181 flow, removed 28 selfloop flow, removed 3 redundant places.
[2023-11-17 11:26:08,070 INFO  L231             Difference]: Finished difference. Result has 79 places, 96 transitions, 839 flow
[2023-11-17 11:26:08,070 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=642, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=79, PETRI_TRANSITIONS=96}
[2023-11-17 11:26:08,071 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 37 predicate places.
[2023-11-17 11:26:08,071 INFO  L495      AbstractCegarLoop]: Abstraction has has 79 places, 96 transitions, 839 flow
[2023-11-17 11:26:08,071 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,071 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:08,071 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]
[2023-11-17 11:26:08,071 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2023-11-17 11:26:08,071 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:08,072 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:08,072 INFO  L85        PathProgramCache]: Analyzing trace with hash -1923772399, now seen corresponding path program 2 times
[2023-11-17 11:26:08,072 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:08,072 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385495859]
[2023-11-17 11:26:08,072 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:08,072 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:08,102 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-11-17 11:26:08,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-11-17 11:26:08,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-11-17 11:26:08,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385495859]
[2023-11-17 11:26:08,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385495859] provided 1 perfect and 0 imperfect interpolant sequences
[2023-11-17 11:26:08,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-11-17 11:26:08,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-11-17 11:26:08,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744806692]
[2023-11-17 11:26:08,221 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-11-17 11:26:08,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2023-11-17 11:26:08,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-11-17 11:26:08,222 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2023-11-17 11:26:08,222 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2023-11-17 11:26:08,222 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 20 out of 70
[2023-11-17 11:26:08,222 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 96 transitions, 839 flow. Second operand  has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,222 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2023-11-17 11:26:08,222 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 70
[2023-11-17 11:26:08,222 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2023-11-17 11:26:08,749 INFO  L124   PetriNetUnfolderBase]: 3092/5069 cut-off events.
[2023-11-17 11:26:08,749 INFO  L125   PetriNetUnfolderBase]: For 18118/18379 co-relation queries the response was YES.
[2023-11-17 11:26:08,762 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 22261 conditions, 5069 events. 3092/5069 cut-off events. For 18118/18379 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 32718 event pairs, 279 based on Foata normal form. 264/5146 useless extension candidates. Maximal degree in co-relation 22227. Up to 1866 conditions per place. 
[2023-11-17 11:26:08,767 INFO  L140   encePairwiseOnDemand]: 64/70 looper letters, 46 selfloop transitions, 17 changer transitions 104/173 dead transitions.
[2023-11-17 11:26:08,767 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 173 transitions, 1766 flow
[2023-11-17 11:26:08,768 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-11-17 11:26:08,768 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2023-11-17 11:26:08,768 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 188 transitions.
[2023-11-17 11:26:08,768 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.44761904761904764
[2023-11-17 11:26:08,769 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 188 transitions.
[2023-11-17 11:26:08,769 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 188 transitions.
[2023-11-17 11:26:08,769 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2023-11-17 11:26:08,769 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 188 transitions.
[2023-11-17 11:26:08,769 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,770 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,770 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 70.0) internal successors, (490), 7 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,771 INFO  L175             Difference]: Start difference. First operand has 79 places, 96 transitions, 839 flow. Second operand 6 states and 188 transitions.
[2023-11-17 11:26:08,771 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 173 transitions, 1766 flow
[2023-11-17 11:26:08,919 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 173 transitions, 1714 flow, removed 19 selfloop flow, removed 2 redundant places.
[2023-11-17 11:26:08,920 INFO  L231             Difference]: Finished difference. Result has 83 places, 47 transitions, 362 flow
[2023-11-17 11:26:08,921 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=70, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=362, PETRI_PLACES=83, PETRI_TRANSITIONS=47}
[2023-11-17 11:26:08,921 INFO  L281   CegarLoopForPetriNet]: 42 programPoint places, 41 predicate places.
[2023-11-17 11:26:08,921 INFO  L495      AbstractCegarLoop]: Abstraction has has 83 places, 47 transitions, 362 flow
[2023-11-17 11:26:08,922 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-11-17 11:26:08,922 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2023-11-17 11:26:08,922 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:08,922 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2023-11-17 11:26:08,922 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] ===
[2023-11-17 11:26:08,922 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2023-11-17 11:26:08,922 INFO  L85        PathProgramCache]: Analyzing trace with hash 1214020655, now seen corresponding path program 1 times
[2023-11-17 11:26:08,922 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-11-17 11:26:08,922 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550779029]
[2023-11-17 11:26:08,923 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-11-17 11:26:08,923 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-11-17 11:26:08,958 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 11:26:08,958 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2023-11-17 11:26:09,004 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2023-11-17 11:26:09,045 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2023-11-17 11:26:09,045 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2023-11-17 11:26:09,046 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining)
[2023-11-17 11:26:09,048 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining)
[2023-11-17 11:26:09,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining)
[2023-11-17 11:26:09,049 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining)
[2023-11-17 11:26:09,051 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining)
[2023-11-17 11:26:09,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining)
[2023-11-17 11:26:09,052 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining)
[2023-11-17 11:26:09,052 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2023-11-17 11:26:09,052 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2023-11-17 11:26:09,059 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-11-17 11:26:09,059 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-11-17 11:26:09,114 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
[2023-11-17 11:26:09,116 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2023-11-17 11:26:09,117 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2023-11-17 11:26:09,120 WARN  L1572  BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2023-11-17 11:26:09,134 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.11 11:26:09 BasicIcfg
[2023-11-17 11:26:09,134 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-11-17 11:26:09,135 INFO  L158              Benchmark]: Toolchain (without parser) took 24826.30ms. Allocated memory was 249.6MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 201.4MB in the beginning and 1.7GB in the end (delta: -1.5GB). Peak memory consumption was 1.1GB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,135 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 191.9MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB.
[2023-11-17 11:26:09,135 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 508.90ms. Allocated memory is still 249.6MB. Free memory was 200.8MB in the beginning and 177.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,135 INFO  L158              Benchmark]: Boogie Procedure Inliner took 77.99ms. Allocated memory is still 249.6MB. Free memory was 177.2MB in the beginning and 174.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,136 INFO  L158              Benchmark]: Boogie Preprocessor took 41.66ms. Allocated memory is still 249.6MB. Free memory was 174.1MB in the beginning and 172.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,136 INFO  L158              Benchmark]: RCFGBuilder took 689.38ms. Allocated memory is still 249.6MB. Free memory was 172.0MB in the beginning and 120.1MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,136 INFO  L158              Benchmark]: TraceAbstraction took 23500.89ms. Allocated memory was 249.6MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 119.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB.
[2023-11-17 11:26:09,137 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.11ms. Allocated memory is still 191.9MB. Free memory is still 140.9MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 508.90ms. Allocated memory is still 249.6MB. Free memory was 200.8MB in the beginning and 177.2MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 77.99ms. Allocated memory is still 249.6MB. Free memory was 177.2MB in the beginning and 174.1MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 41.66ms. Allocated memory is still 249.6MB. Free memory was 174.1MB in the beginning and 172.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 689.38ms. Allocated memory is still 249.6MB. Free memory was 172.0MB in the beginning and 120.1MB in the end (delta: 51.9MB). Peak memory consumption was 52.4MB. Max. memory is 8.0GB.
 * TraceAbstraction took 23500.89ms. Allocated memory was 249.6MB in the beginning and 2.9GB in the end (delta: 2.6GB). Free memory was 119.0MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.0GB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
  - GenericResult: Unfinished Backtranslation
    Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
  - GenericResult: Unfinished Backtranslation
    The program execution was not completely translated back.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: PetriNetLargeBlockEncoding benchmarks
    Lipton Reduction Statistics: ReductionTime: 1.6s, 57 PlacesBefore, 42 PlacesAfterwards, 45 TransitionsBefore, 29 TransitionsAfterwards, 1226 CoEnabledTransitionPairs, 3 FixpointIterations, 0 TrivialSequentialCompositions, 18 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 2 ConcurrentYvCompositions, 1 ChoiceCompositions, 21 TotalNumberOfCompositions, 3125 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1513, independent: 1404, independent conditional: 0, independent unconditional: 1404, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 836, independent: 794, independent conditional: 0, independent unconditional: 794, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 836, independent: 775, independent conditional: 0, independent unconditional: 775, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 61, independent: 19, independent conditional: 0, independent unconditional: 19, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 219, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0]  ], Cache Queries: [ total: 1513, independent: 610, independent conditional: 0, independent unconditional: 610, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 836, unknown conditional: 0, unknown unconditional: 836] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0
  - CounterExampleResult [Line: 18]: a call to reach_error is reachable
    a call to reach_error is reachable
We found a FailurePath: 
[L710]               0  int __unbuffered_cnt = 0;
[L712]               0  int __unbuffered_p0_EAX = 0;
[L714]               0  int __unbuffered_p3_EAX = 0;
[L716]               0  int __unbuffered_p3_EBX = 0;
[L718]               0  int a = 0;
[L719]               0  _Bool main$tmp_guard0;
[L720]               0  _Bool main$tmp_guard1;
[L722]               0  int x = 0;
[L724]               0  int y = 0;
[L725]               0  _Bool y$flush_delayed;
[L726]               0  int y$mem_tmp;
[L727]               0  _Bool y$r_buff0_thd0;
[L728]               0  _Bool y$r_buff0_thd1;
[L729]               0  _Bool y$r_buff0_thd2;
[L730]               0  _Bool y$r_buff0_thd3;
[L731]               0  _Bool y$r_buff0_thd4;
[L732]               0  _Bool y$r_buff1_thd0;
[L733]               0  _Bool y$r_buff1_thd1;
[L734]               0  _Bool y$r_buff1_thd2;
[L735]               0  _Bool y$r_buff1_thd3;
[L736]               0  _Bool y$r_buff1_thd4;
[L737]               0  _Bool y$read_delayed;
[L738]               0  int *y$read_delayed_var;
[L739]               0  int y$w_buff0;
[L740]               0  _Bool y$w_buff0_used;
[L741]               0  int y$w_buff1;
[L742]               0  _Bool y$w_buff1_used;
[L744]               0  int z = 0;
[L745]               0  _Bool weak$$choice0;
[L746]               0  _Bool weak$$choice2;
[L846]               0  pthread_t t773;
[L847]  FCALL, FORK  0  pthread_create(&t773, ((void *)0), P0, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L848]               0  pthread_t t774;
[L849]  FCALL, FORK  0  pthread_create(&t774, ((void *)0), P1, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L850]               0  pthread_t t775;
[L851]  FCALL, FORK  0  pthread_create(&t775, ((void *)0), P2, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L785]               3  y$w_buff1 = y$w_buff0
[L786]               3  y$w_buff0 = 2
[L787]               3  y$w_buff1_used = y$w_buff0_used
[L788]               3  y$w_buff0_used = (_Bool)1
[L789]  CALL         3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L18]   COND FALSE   3  !(!expression)
[L789]  RET          3  __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used))
[L790]               3  y$r_buff1_thd0 = y$r_buff0_thd0
[L791]               3  y$r_buff1_thd1 = y$r_buff0_thd1
[L792]               3  y$r_buff1_thd2 = y$r_buff0_thd2
[L793]               3  y$r_buff1_thd3 = y$r_buff0_thd3
[L794]               3  y$r_buff1_thd4 = y$r_buff0_thd4
[L795]               3  y$r_buff0_thd3 = (_Bool)1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=0]
[L798]               3  z = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L852]               0  pthread_t t776;
[L853]  FCALL, FORK  0  pthread_create(&t776, ((void *)0), P3, ((void *)0))
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=1]
[L815]               4  z = 2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L818]               4  __unbuffered_p3_EAX = z
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L821]               4  __unbuffered_p3_EBX = a
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L750]               1  a = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L753]               1  __unbuffered_p0_EAX = x
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L765]               2  x = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0, z=2]
[L768]               2  y = 1
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L771]               2  y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)
[L772]               2  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used
[L773]               2  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used
[L774]               2  y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2
[L775]               2  y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=1, z=2]
[L801]               3  y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y)
[L802]               3  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used
[L803]               3  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used
[L804]               3  y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3
[L805]               3  y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3
        VAL             [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L824]               4  y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y)
[L825]               4  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used
[L826]               4  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used
[L827]               4  y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4
[L828]               4  y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4
[L758]               1  __unbuffered_cnt = __unbuffered_cnt + 1
[L760]               1  return 0;
[L778]               2  __unbuffered_cnt = __unbuffered_cnt + 1
[L780]               2  return 0;
[L808]               3  __unbuffered_cnt = __unbuffered_cnt + 1
[L810]               3  return 0;
[L831]               4  __unbuffered_cnt = __unbuffered_cnt + 1
[L833]               4  return 0;
[L855]               0  main$tmp_guard0 = __unbuffered_cnt == 4
[L857]  CALL         0  assume_abort_if_not(main$tmp_guard0)
[L3]    COND FALSE   0  !(!cond)
[L857]  RET          0  assume_abort_if_not(main$tmp_guard0)
[L859]               0  y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y)
[L860]               0  y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used
[L861]               0  y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used
[L862]               0  y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0
[L863]               0  y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0
        VAL             [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t773={5:0}, t774={6:0}, t775={7:0}, t776={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]
[L866]               0  weak$$choice0 = __VERIFIER_nondet_bool()
[L867]               0  weak$$choice2 = __VERIFIER_nondet_bool()
[L868]               0  y$flush_delayed = weak$$choice2
[L869]               0  y$mem_tmp = y
[L870]               0  y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1)
[L871]               0  y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0))
[L872]               0  y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1))
[L873]               0  y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used))
[L874]               0  y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L875]               0  y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0))
[L876]               0  y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0))
[L877]               0  main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0)
[L878]               0  y = y$flush_delayed ? y$mem_tmp : y
[L879]               0  y$flush_delayed = (_Bool)0
[L881]  CALL         0  __VERIFIER_assert(main$tmp_guard1)
[L18]   COND TRUE    0  !expression
[L18]                0  reach_error()
        VAL             [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=2, z=2]

  - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
    Unable to prove that a call to reach_error is unreachable
 Reason: Not analyzed. 
  - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 847]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message)
    Unable to prove that petrification did provide enough thread instances (tool internal message)
 Reason: Not analyzed. 
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 9 procedures, 83 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 368 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 368 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1096 IncrementalHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 43 mSDtfsCounter, 1096 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=939occurred in iteration=7, InterpolantAutomatonStates: 60, 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, 6.1s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 1553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2023-11-17 11:26:09,154 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...