/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf --traceabstraction.dfs.order.used.in.por LOOP_LOCKSTEP --traceabstraction.additional.conditional.commutativity.checking IA --traceabstraction.criterion.for.conditional.commutativity.checking DEFAULT -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i
--------------------------------------------------------------------------------
This is Ultimate 0.2.4-wip.dk.conditional-comm-17da818-m
[2024-05-04 22:13:55,689 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-05-04 22:13:55,755 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../benchexec/../../../trunk/examples/settings/gemcutter/NewStatesSleep.epf
[2024-05-04 22:13:55,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-05-04 22:13:55,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-05-04 22:13:55,784 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-05-04 22:13:55,785 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-05-04 22:13:55,785 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-05-04 22:13:55,786 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-05-04 22:13:55,789 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-05-04 22:13:55,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-05-04 22:13:55,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-05-04 22:13:55,790 INFO L153 SettingsManager]: * Use SBE=true
[2024-05-04 22:13:55,792 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-05-04 22:13:55,792 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-05-04 22:13:55,793 INFO L153 SettingsManager]: * sizeof long=4
[2024-05-04 22:13:55,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-05-04 22:13:55,793 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-05-04 22:13:55,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-05-04 22:13:55,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-05-04 22:13:55,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-05-04 22:13:55,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-05-04 22:13:55,795 INFO L153 SettingsManager]: * sizeof long double=12
[2024-05-04 22:13:55,795 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-05-04 22:13:55,796 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-05-04 22:13:55,796 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-05-04 22:13:55,796 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-05-04 22:13:55,796 INFO L153 SettingsManager]: * To the following directory=./dump/
[2024-05-04 22:13:55,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-05-04 22:13:55,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-05-04 22:13:55,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-05-04 22:13:55,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-05-04 22:13:55,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-05-04 22:13:55,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-05-04 22:13:55,799 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_NEW_STATES
[2024-05-04 22:13:55,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-05-04 22:13:55,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-05-04 22:13:55,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-05-04 22:13:55,799 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-05-04 22:13:55,799 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/UGemCutter-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.traceabstraction: DFS Order used in POR -> LOOP_LOCKSTEP
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Additional conditional commutativity checking -> IA
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Criterion for conditional commutativity checking -> DEFAULT
[2024-05-04 22:13:56,090 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-05-04 22:13:56,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-05-04 22:13:56,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-05-04 22:13:56,121 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-05-04 22:13:56,121 INFO L274 PluginConnector]: CDTParser initialized
[2024-05-04 22:13:56,122 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/pthread-wmm/mix015.oepc.i
[2024-05-04 22:13:57,336 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-05-04 22:13:57,568 INFO L384 CDTParser]: Found 1 translation units.
[2024-05-04 22:13:57,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix015.oepc.i
[2024-05-04 22:13:57,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/43c427b92/1de2ebc3593c4b77b83f7ad34cb7f829/FLAG0ee9dcb50
[2024-05-04 22:13:57,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/43c427b92/1de2ebc3593c4b77b83f7ad34cb7f829
[2024-05-04 22:13:57,606 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-05-04 22:13:57,607 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements.
[2024-05-04 22:13:57,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-05-04 22:13:57,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-05-04 22:13:57,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-05-04 22:13:57,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:13:57" (1/1) ...
[2024-05-04 22:13:57,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c2a0c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:57, skipping insertion in model container
[2024-05-04 22:13:57,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.05 10:13:57" (1/1) ...
[2024-05-04 22:13:57,675 INFO L177 MainTranslator]: Built tables and reachable declarations
[2024-05-04 22:13:57,821 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/mix015.oepc.i[945,958]
[2024-05-04 22:13:58,050 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-05-04 22:13:58,063 INFO L202 MainTranslator]: Completed pre-run
[2024-05-04 22:13:58,081 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/mix015.oepc.i[945,958]
[2024-05-04 22:13:58,145 INFO L209 PostProcessor]: Analyzing one entry point: main
[2024-05-04 22:13:58,179 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2024-05-04 22:13:58,180 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2024-05-04 22:13:58,186 INFO L206 MainTranslator]: Completed translation
[2024-05-04 22:13:58,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58 WrapperNode
[2024-05-04 22:13:58,189 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-05-04 22:13:58,190 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-05-04 22:13:58,190 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-05-04 22:13:58,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-05-04 22:13:58,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,227 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,260 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 137
[2024-05-04 22:13:58,261 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-05-04 22:13:58,261 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-05-04 22:13:58,261 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-05-04 22:13:58,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-05-04 22:13:58,272 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,285 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,324 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,349 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,351 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-05-04 22:13:58,398 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-05-04 22:13:58,398 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-05-04 22:13:58,398 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-05-04 22:13:58,403 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (1/1) ...
[2024-05-04 22:13:58,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-05-04 22:13:58,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-05-04 22:13:58,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-05-04 22:13:58,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-05-04 22:13:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2024-05-04 22:13:58,485 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-05-04 22:13:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-05-04 22:13:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-05-04 22:13:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-05-04 22:13:58,486 INFO L130 BoogieDeclarations]: Found specification of procedure P0
[2024-05-04 22:13:58,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P0
[2024-05-04 22:13:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure P1
[2024-05-04 22:13:58,487 INFO L138 BoogieDeclarations]: Found implementation of procedure P1
[2024-05-04 22:13:58,487 INFO L130 BoogieDeclarations]: Found specification of procedure P2
[2024-05-04 22:13:58,488 INFO L138 BoogieDeclarations]: Found implementation of procedure P2
[2024-05-04 22:13:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int
[2024-05-04 22:13:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-05-04 22:13:58,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-05-04 22:13:58,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-05-04 22:13:58,490 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-05-04 22:13:58,632 INFO L241 CfgBuilder]: Building ICFG
[2024-05-04 22:13:58,634 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-05-04 22:13:58,977 INFO L282 CfgBuilder]: Performing block encoding
[2024-05-04 22:13:59,094 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-05-04 22:13:59,095 INFO L309 CfgBuilder]: Removed 0 assume(true) statements.
[2024-05-04 22:13:59,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:13:59 BoogieIcfgContainer
[2024-05-04 22:13:59,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-05-04 22:13:59,100 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-05-04 22:13:59,100 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-05-04 22:13:59,103 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-05-04 22:13:59,104 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.05 10:13:57" (1/3) ...
[2024-05-04 22:13:59,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3b7da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:13:59, skipping insertion in model container
[2024-05-04 22:13:59,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.05 10:13:58" (2/3) ...
[2024-05-04 22:13:59,105 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f3b7da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.05 10:13:59, skipping insertion in model container
[2024-05-04 22:13:59,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.05 10:13:59" (3/3) ...
[2024-05-04 22:13:59,107 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.oepc.i
[2024-05-04 22:13:59,117 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-05-04 22:13:59,126 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-05-04 22:13:59,126 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations.
[2024-05-04 22:13:59,126 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-05-04 22:13:59,176 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions.
[2024-05-04 22:13:59,223 INFO L100 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-05-04 22:13:59,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-05-04 22:13:59,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-05-04 22:13:59,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-05-04 22:13:59,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-05-04 22:13:59,260 INFO L188 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-05-04 22:13:59,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:13:59,273 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-05-04 22:13:59,279 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=true, mAutomataTypeConcurrency=PARTIAL_ORDER_FA, 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;@52d6f5cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms], mConComChecker=IA, mConComCheckerCriterion=DEFAULT, mConComCheckerLimitedChecksCriterion=false, mConComCheckerCriterionLimit=1, mConComCheckerRandomProb=100, mConComCheckerRandomSeed=123, mConComCheckerConditionCriterion=false
[2024-05-04 22:13:59,280 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2024-05-04 22:13:59,326 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:13:59,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:13:59,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1091558965, now seen corresponding path program 1 times
[2024-05-04 22:13:59,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:13:59,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973851060]
[2024-05-04 22:13:59,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:13:59,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:13:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:13:59,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:13:59,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:13:59,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973851060]
[2024-05-04 22:13:59,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973851060] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:13:59,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:13:59,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-05-04 22:13:59,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825002648]
[2024-05-04 22:13:59,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:13:59,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-05-04 22:13:59,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:13:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-05-04 22:13:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-05-04 22:13:59,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:13:59,706 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:13:59,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 44.5) internal successors, (89), 2 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:13:59,707 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:13:59,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:13:59,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-05-04 22:13:59,763 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:13:59,763 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:13:59,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1350479870, now seen corresponding path program 1 times
[2024-05-04 22:13:59,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:13:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6159840]
[2024-05-04 22:13:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:13:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:13:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:01,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:01,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:01,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6159840]
[2024-05-04 22:14:01,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6159840] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:01,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:01,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-04 22:14:01,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229422717]
[2024-05-04 22:14:01,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:01,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-05-04 22:14:01,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:01,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-05-04 22:14:01,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72
[2024-05-04 22:14:01,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,267 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:01,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 9 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:14:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,268 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:01,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-05-04 22:14:01,337 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:01,338 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:01,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1528365408, now seen corresponding path program 1 times
[2024-05-04 22:14:01,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:01,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857878872]
[2024-05-04 22:14:01,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:01,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:01,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:01,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:01,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857878872]
[2024-05-04 22:14:01,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857878872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:01,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:01,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-04 22:14:01,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187969674]
[2024-05-04 22:14:01,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:01,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-04 22:14:01,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:01,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-04 22:14:01,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-05-04 22:14:01,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,750 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:01,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 7 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:14:01,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:01,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:01,751 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:02,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:02,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-05-04 22:14:02,036 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:02,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:02,038 INFO L85 PathProgramCache]: Analyzing trace with hash -67170877, now seen corresponding path program 1 times
[2024-05-04 22:14:02,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253523779]
[2024-05-04 22:14:02,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:02,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:02,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:02,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253523779]
[2024-05-04 22:14:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253523779] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:02,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:02,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-04 22:14:02,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411073308]
[2024-05-04 22:14:02,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:02,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-04 22:14:02,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:02,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-05-04 22:14:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56
[2024-05-04 22:14:02,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,391 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:02,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:14:02,392 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,393 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:02,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:02,395 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:02,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:02,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-05-04 22:14:02,561 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:02,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:02,562 INFO L85 PathProgramCache]: Analyzing trace with hash 32750411, now seen corresponding path program 1 times
[2024-05-04 22:14:02,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:02,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517189084]
[2024-05-04 22:14:02,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:02,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:03,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:03,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517189084]
[2024-05-04 22:14:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517189084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12
[2024-05-04 22:14:03,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212008832]
[2024-05-04 22:14:03,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:03,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-05-04 22:14:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:03,734 INFO L85 PathProgramCache]: Analyzing trace with hash -883479281, now seen corresponding path program 1 times
[2024-05-04 22:14:03,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:03,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:03,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:03,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:03,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-05-04 22:14:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156
[2024-05-04 22:14:03,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:03,870 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:03,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 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)
[2024-05-04 22:14:03,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:03,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:03,870 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:03,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:03,871 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:04,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states.
[2024-05-04 22:14:04,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:04,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5
[2024-05-04 22:14:04,437 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:04,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:04,438 INFO L85 PathProgramCache]: Analyzing trace with hash -10793613, now seen corresponding path program 2 times
[2024-05-04 22:14:04,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:04,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761699981]
[2024-05-04 22:14:04,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:04,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:04,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:04,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761699981]
[2024-05-04 22:14:04,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761699981] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:04,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:04,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-04 22:14:04,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507873872]
[2024-05-04 22:14:04,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:04,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-04 22:14:04,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:06,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1292313941, now seen corresponding path program 1 times
[2024-05-04 22:14:06,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:06,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:06,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:06,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:06,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:06,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:06,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2017850003, now seen corresponding path program 1 times
[2024-05-04 22:14:06,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:06,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:06,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:06,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1871159717, now seen corresponding path program 1 times
[2024-05-04 22:14:06,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:06,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:07,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2123590546, now seen corresponding path program 1 times
[2024-05-04 22:14:07,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:07,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:07,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1406797114, now seen corresponding path program 1 times
[2024-05-04 22:14:07,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,542 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash -661037201, now seen corresponding path program 1 times
[2024-05-04 22:14:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,805 INFO L85 PathProgramCache]: Analyzing trace with hash 982683623, now seen corresponding path program 2 times
[2024-05-04 22:14:07,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:07,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,836 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:07,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2024-05-04 22:14:07,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156
[2024-05-04 22:14:07,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:07,876 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:07,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 20.0) internal successors, (220), 13 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:14:07,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:07,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:07,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:07,876 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states.
[2024-05-04 22:14:07,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:07,877 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-05-04 22:14:09,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:09,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-05-04 22:14:09,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,SelfDestructingSolverStorable12,SelfDestructingSolverStorable9,SelfDestructingSolverStorable13,SelfDestructingSolverStorable14,SelfDestructingSolverStorable15,SelfDestructingSolverStorable16,SelfDestructingSolverStorable17
[2024-05-04 22:14:09,295 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:09,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash -45664141, now seen corresponding path program 3 times
[2024-05-04 22:14:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115245920]
[2024-05-04 22:14:09,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:09,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:09,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:09,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:09,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115245920]
[2024-05-04 22:14:09,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115245920] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:09,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:09,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-05-04 22:14:09,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77815180]
[2024-05-04 22:14:09,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:09,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-05-04 22:14:09,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:18,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1590979415, now seen corresponding path program 1 times
[2024-05-04 22:14:18,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:18,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:18,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:18,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:18,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:18,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1903957207, now seen corresponding path program 1 times
[2024-05-04 22:14:19,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:19,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:19,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:19,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1903957207, now seen corresponding path program 2 times
[2024-05-04 22:14:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:20,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:20,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:20,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1076330709, now seen corresponding path program 1 times
[2024-05-04 22:14:27,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,583 INFO L85 PathProgramCache]: Analyzing trace with hash 993486752, now seen corresponding path program 1 times
[2024-05-04 22:14:27,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,761 INFO L85 PathProgramCache]: Analyzing trace with hash 733318604, now seen corresponding path program 1 times
[2024-05-04 22:14:27,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:27,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:27,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1258040609, now seen corresponding path program 1 times
[2024-05-04 22:14:27,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:27,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 344553581, now seen corresponding path program 2 times
[2024-05-04 22:14:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,325 INFO L85 PathProgramCache]: Analyzing trace with hash 2091226789, now seen corresponding path program 2 times
[2024-05-04 22:14:28,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,530 INFO L85 PathProgramCache]: Analyzing trace with hash 403521390, now seen corresponding path program 2 times
[2024-05-04 22:14:28,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:28,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:28,736 INFO L85 PathProgramCache]: Analyzing trace with hash -375738426, now seen corresponding path program 2 times
[2024-05-04 22:14:28,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:28,759 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:28,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1237011055, now seen corresponding path program 2 times
[2024-05-04 22:14:28,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:28,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:28,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:29,039 INFO L85 PathProgramCache]: Analyzing trace with hash -307362585, now seen corresponding path program 3 times
[2024-05-04 22:14:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:29,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:29,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:29,079 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:29,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-05-04 22:14:29,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506
[2024-05-04 22:14:29,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:29,196 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:29,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 18 states have (on average 23.555555555555557) internal successors, (424), 23 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states.
[2024-05-04 22:14:29,197 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:30,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-05-04 22:14:30,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states.
[2024-05-04 22:14:30,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,SelfDestructingSolverStorable30,SelfDestructingSolverStorable41,SelfDestructingSolverStorable20,SelfDestructingSolverStorable31,SelfDestructingSolverStorable18,SelfDestructingSolverStorable29,SelfDestructingSolverStorable19,SelfDestructingSolverStorable21,SelfDestructingSolverStorable32,SelfDestructingSolverStorable22,SelfDestructingSolverStorable33,SelfDestructingSolverStorable23,SelfDestructingSolverStorable34,SelfDestructingSolverStorable24,SelfDestructingSolverStorable35,SelfDestructingSolverStorable25,SelfDestructingSolverStorable36,SelfDestructingSolverStorable26,SelfDestructingSolverStorable37,SelfDestructingSolverStorable27,SelfDestructingSolverStorable38,SelfDestructingSolverStorable28,SelfDestructingSolverStorable39
[2024-05-04 22:14:30,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:30,719 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:30,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1004112053, now seen corresponding path program 4 times
[2024-05-04 22:14:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:30,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532449013]
[2024-05-04 22:14:30,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:30,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:30,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-05-04 22:14:30,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-05-04 22:14:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-05-04 22:14:30,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532449013]
[2024-05-04 22:14:30,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532449013] provided 1 perfect and 0 imperfect interpolant sequences
[2024-05-04 22:14:30,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-05-04 22:14:30,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-05-04 22:14:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754502731]
[2024-05-04 22:14:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-05-04 22:14:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-05-04 22:14:30,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-05-04 22:14:30,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1444313487, now seen corresponding path program 1 times
[2024-05-04 22:14:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:30,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:30,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:30,958 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:34,316 INFO L85 PathProgramCache]: Analyzing trace with hash -560367181, now seen corresponding path program 1 times
[2024-05-04 22:14:34,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:34,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:34,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:34,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:34,419 INFO L85 PathProgramCache]: Analyzing trace with hash 428077327, now seen corresponding path program 4 times
[2024-05-04 22:14:34,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:34,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:34,443 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:34,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-05-04 22:14:34,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90
[2024-05-04 22:14:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:34,476 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-05-04 22:14:34,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 7 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)
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 16 states.
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:34,476 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states.
[2024-05-04 22:14:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states.
[2024-05-04 22:14:34,477 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-05-04 22:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-05-04 22:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-05-04 22:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states.
[2024-05-04 22:14:35,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states.
[2024-05-04 22:14:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states.
[2024-05-04 22:14:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states.
[2024-05-04 22:14:35,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-05-04 22:14:35,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,SelfDestructingSolverStorable43,SelfDestructingSolverStorable44,SelfDestructingSolverStorable45
[2024-05-04 22:14:35,681 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] ===
[2024-05-04 22:14:35,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier
[2024-05-04 22:14:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash 665249995, now seen corresponding path program 5 times
[2024-05-04 22:14:35,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-05-04 22:14:35,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506970626]
[2024-05-04 22:14:35,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-05-04 22:14:35,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-05-04 22:14:35,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:35,721 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-05-04 22:14:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-05-04 22:14:35,755 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-05-04 22:14:35,756 INFO L363 BasicCegarLoop]: Counterexample is feasible
[2024-05-04 22:14:35,757 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2024-05-04 22:14:35,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2024-05-04 22:14:35,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining)
[2024-05-04 22:14:35,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining)
[2024-05-04 22:14:35,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2024-05-04 22:14:35,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining)
[2024-05-04 22:14:35,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46
[2024-05-04 22:14:35,767 INFO L448 BasicCegarLoop]: Path program histogram: [5, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-05-04 22:14:35,773 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-05-04 22:14:35,773 INFO L178 ceAbstractionStarter]: Computing trace abstraction results
[2024-05-04 22:14:35,857 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
[2024-05-04 22:14:35,863 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
[2024-05-04 22:14:35,864 WARN L1576 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
[2024-05-04 22:14:35,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.05 10:14:35 BasicIcfg
[2024-05-04 22:14:35,889 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-05-04 22:14:35,890 INFO L158 Benchmark]: Toolchain (without parser) took 38282.84ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 838.9MB). Free memory was 213.9MB in the beginning and 957.0MB in the end (delta: -743.1MB). Peak memory consumption was 97.3MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,891 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 287.3MB. Free memory is still 254.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-05-04 22:14:35,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 580.91ms. Allocated memory is still 287.3MB. Free memory was 213.7MB in the beginning and 189.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.60ms. Allocated memory is still 287.3MB. Free memory was 189.8MB in the beginning and 187.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,892 INFO L158 Benchmark]: Boogie Preprocessor took 135.65ms. Allocated memory is still 287.3MB. Free memory was 187.2MB in the beginning and 253.7MB in the end (delta: -66.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,892 INFO L158 Benchmark]: RCFGBuilder took 699.07ms. Allocated memory is still 287.3MB. Free memory was 253.7MB in the beginning and 215.9MB in the end (delta: 37.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,892 INFO L158 Benchmark]: TraceAbstraction took 36789.46ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 838.9MB). Free memory was 214.9MB in the beginning and 957.0MB in the end (delta: -742.1MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB.
[2024-05-04 22:14:35,893 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.13ms. Allocated memory is still 287.3MB. Free memory is still 254.5MB. There was no memory consumed. Max. memory is 8.0GB.
* CACSL2BoogieTranslator took 580.91ms. Allocated memory is still 287.3MB. Free memory was 213.7MB in the beginning and 189.8MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB.
* Boogie Procedure Inliner took 70.60ms. Allocated memory is still 287.3MB. Free memory was 189.8MB in the beginning and 187.3MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
* Boogie Preprocessor took 135.65ms. Allocated memory is still 287.3MB. Free memory was 187.2MB in the beginning and 253.7MB in the end (delta: -66.5MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB.
* RCFGBuilder took 699.07ms. Allocated memory is still 287.3MB. Free memory was 253.7MB in the beginning and 215.9MB in the end (delta: 37.7MB). Peak memory consumption was 36.7MB. Max. memory is 8.0GB.
* TraceAbstraction took 36789.46ms. Allocated memory was 287.3MB in the beginning and 1.1GB in the end (delta: 838.9MB). Free memory was 214.9MB in the beginning and 957.0MB in the end (delta: -742.1MB). Peak memory consumption was 98.3MB. Max. memory is 8.0GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator:
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated
- GenericResult: Unfinished Backtranslation
Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated
- GenericResult: Unfinished Backtranslation
The program execution was not completely translated back.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: Independence relation #1 benchmarks
ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 86488, independent: 83810, independent conditional: 83633, independent unconditional: 177, dependent: 2678, dependent conditional: 2677, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 84637, independent: 83810, independent conditional: 83633, independent unconditional: 177, dependent: 827, dependent conditional: 826, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ ConditionTransformingIndependenceRelation.Independence Queries: [ total: 84637, independent: 83810, independent conditional: 83633, independent unconditional: 177, dependent: 827, dependent conditional: 826, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 84637, independent: 83810, independent conditional: 83633, independent unconditional: 177, dependent: 827, dependent conditional: 826, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 2110, independent unconditional: 81700, dependent: 8814, dependent conditional: 5595, dependent unconditional: 3219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 1707, independent unconditional: 82103, dependent: 8814, dependent conditional: 2330, dependent unconditional: 6484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 1707, independent unconditional: 82103, dependent: 8814, dependent conditional: 2330, dependent unconditional: 6484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 905, independent: 843, independent conditional: 92, independent unconditional: 751, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 905, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 142, independent: 80, independent conditional: 75, independent unconditional: 5, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 80, independent conditional: 75, independent unconditional: 5, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 936, independent: 361, independent conditional: 351, independent unconditional: 10, dependent: 576, dependent conditional: 429, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 92624, independent: 82967, independent conditional: 1615, independent unconditional: 81352, dependent: 8752, dependent conditional: 2288, dependent unconditional: 6464, unknown: 905, unknown conditional: 134, unknown unconditional: 771] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 843, Positive conditional cache size: 92, Positive unconditional cache size: 751, Negative cache size: 62, Negative conditional cache size: 42, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3668, Maximal queried relation: 6, ConditionTransformingIndependenceRelation.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 2110, independent unconditional: 81700, dependent: 8814, dependent conditional: 5595, dependent unconditional: 3219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 1707, independent unconditional: 82103, dependent: 8814, dependent conditional: 2330, dependent unconditional: 6484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 92624, independent: 83810, independent conditional: 1707, independent unconditional: 82103, dependent: 8814, dependent conditional: 2330, dependent unconditional: 6484, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 905, independent: 843, independent conditional: 92, independent unconditional: 751, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 905, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 142, independent: 80, independent conditional: 75, independent unconditional: 5, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 142, independent: 80, independent conditional: 75, independent unconditional: 5, dependent: 62, dependent conditional: 42, dependent unconditional: 20, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 936, independent: 361, independent conditional: 351, independent unconditional: 10, dependent: 576, dependent conditional: 429, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 92624, independent: 82967, independent conditional: 1615, independent unconditional: 81352, dependent: 8752, dependent conditional: 2288, dependent unconditional: 6464, unknown: 905, unknown conditional: 134, unknown unconditional: 771] , Statistics on independence cache: Total cache size (in pairs): 905, Positive cache size: 843, Positive conditional cache size: 92, Positive unconditional cache size: 751, Negative cache size: 62, Negative conditional cache size: 42, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 3668 ], Independence queries for same thread: 1851
- CounterExampleResult [Line: 18]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L709] 0 int __unbuffered_cnt = 0;
VAL [__unbuffered_cnt=0]
[L711] 0 int __unbuffered_p0_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0]
[L713] 0 int __unbuffered_p0_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0]
[L715] 0 int __unbuffered_p1_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0]
[L717] 0 int __unbuffered_p2_EAX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0]
[L719] 0 int __unbuffered_p2_EBX = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0]
[L721] 0 int a = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0]
[L722] 0 _Bool a$flush_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a=0]
[L723] 0 int a$mem_tmp;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a=0]
[L724] 0 _Bool a$r_buff0_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a=0]
[L725] 0 _Bool a$r_buff0_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a=0]
[L726] 0 _Bool a$r_buff0_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a=0]
[L727] 0 _Bool a$r_buff0_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a=0]
[L728] 0 _Bool a$r_buff1_thd0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a=0]
[L729] 0 _Bool a$r_buff1_thd1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a=0]
[L730] 0 _Bool a$r_buff1_thd2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a=0]
[L731] 0 _Bool a$r_buff1_thd3;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a=0]
[L732] 0 _Bool a$read_delayed;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a=0]
[L733] 0 int *a$read_delayed_var;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a=0]
[L734] 0 int a$w_buff0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a=0]
[L735] 0 _Bool a$w_buff0_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a=0]
[L736] 0 int a$w_buff1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a=0]
[L737] 0 _Bool a$w_buff1_used;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0]
[L738] 0 _Bool main$tmp_guard0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0]
[L739] 0 _Bool main$tmp_guard1;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0]
[L741] 0 int x = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0]
[L743] 0 int y = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0]
[L745] 0 int z = 0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0]
[L746] 0 _Bool weak$$choice0;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0]
[L747] 0 _Bool weak$$choice2;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L850] 0 pthread_t t385;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L851] FCALL, FORK 0 pthread_create(&t385, ((void *)0), P0, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L852] 0 pthread_t t386;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L853] FCALL, FORK 0 pthread_create(&t386, ((void *)0), P1, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L854] 0 pthread_t t387;
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L855] FCALL, FORK 0 pthread_create(&t387, ((void *)0), P2, ((void *)0))
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0]
[L751] 1 a$w_buff1 = a$w_buff0
[L752] 1 a$w_buff0 = 1
[L753] 1 a$w_buff1_used = a$w_buff0_used
[L754] 1 a$w_buff0_used = (_Bool)1
[L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L18] COND FALSE 1 !(!expression)
[L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used))
[L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0
[L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1
[L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2
[L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3
[L760] 1 a$r_buff0_thd1 = (_Bool)1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, y=0, z=0]
[L763] 1 x = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0]
[L766] 1 __unbuffered_p0_EAX = x
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0]
[L769] 1 __unbuffered_p0_EBX = y
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0, z=0]
[L786] 2 y = 1
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0]
[L789] 2 __unbuffered_p1_EAX = z
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0]
[L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)
[L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used
[L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used
[L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2
[L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2
VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0]
[L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0]
[L801] 2 return 0;
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=0]
[L806] 3 z = 1
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1]
[L809] 3 __unbuffered_p2_EAX = z
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1]
[L812] 3 weak$$choice0 = __VERIFIER_nondet_bool()
[L813] 3 weak$$choice2 = __VERIFIER_nondet_bool()
[L814] 3 a$flush_delayed = weak$$choice2
[L815] 3 a$mem_tmp = a
[L816] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)
[L817] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0))
[L818] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1))
[L819] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used))
[L820] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L821] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3))
[L822] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))
[L823] 3 __unbuffered_p2_EBX = a
[L824] 3 a = a$flush_delayed ? a$mem_tmp : a
[L825] 3 a$flush_delayed = (_Bool)0
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L828] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a)
[L829] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used
[L830] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used
[L831] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3
[L832] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3
VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L837] 3 return 0;
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a)
[L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used
[L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used
[L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1
[L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=1]
[L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=1, y=1, z=1]
[L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=0, x=1, y=1, z=1]
[L859] CALL 0 assume_abort_if_not(main$tmp_guard0)
[L3] COND FALSE 0 !(!cond)
VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L859] RET 0 assume_abort_if_not(main$tmp_guard0)
[L861] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a)
[L862] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used
[L863] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used
[L864] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0
[L865] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=0, x=1, y=1, z=1]
[L868] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0)
VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t385={5:0}, t386={6:0}, t387={3:0}, weak$$choice2=0, x=1, y=1, z=1]
[L870] CALL 0 __VERIFIER_assert(main$tmp_guard1)
[L18] COND TRUE 0 !expression
VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
[L18] 0 reach_error()
VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1]
- UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable
Unable to prove that a call to reach_error is unreachable
Reason: Not analyzed.
- UnprovableResult [Line: 855]: 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: 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.
- StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 36.5s, OverallIterations: 9, TraceHistogramMax: 0, PathProgramHistogramMax: 5, EmptinessCheckTime: 5.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 105, 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.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 825 NumberOfCodeBlocks, 825 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 722 ConstructedInterpolants, 0 QuantifiedInterpolants, 3245 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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, ConditionalCommutativityCheckTime: 26.5s, ConditionalCommutativityIAIntegrations: 14, ConditionalCommutativityDFSRestarts: 0, ConditionalCommutativityConditionCalculations: 24, ConditionalCommutativityTraceChecks: 24, ConditionalCommutativityImperfectProofs: 0
RESULT: Ultimate proved your program to be incorrect!
[2024-05-04 22:14:35,915 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0
[2024-05-04 22:14:36,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...