/usr/bin/java -Xmx7000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c


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


This is Ultimate 0.2.3-wip.dk.dynamic-abstractions-fffa3fa-m
[2023-09-05 00:09:25,029 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2023-09-05 00:09:25,086 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf
[2023-09-05 00:09:25,088 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2023-09-05 00:09:25,089 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2023-09-05 00:09:25,089 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2023-09-05 00:09:25,107 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2023-09-05 00:09:25,108 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2023-09-05 00:09:25,108 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2023-09-05 00:09:25,108 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2023-09-05 00:09:25,109 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2023-09-05 00:09:25,109 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2023-09-05 00:09:25,109 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2023-09-05 00:09:25,110 INFO  L153        SettingsManager]:  * Use SBE=true
[2023-09-05 00:09:25,110 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2023-09-05 00:09:25,110 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2023-09-05 00:09:25,110 INFO  L153        SettingsManager]:  * sizeof long=4
[2023-09-05 00:09:25,111 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2023-09-05 00:09:25,111 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2023-09-05 00:09:25,111 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2023-09-05 00:09:25,111 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2023-09-05 00:09:25,114 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2023-09-05 00:09:25,114 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2023-09-05 00:09:25,114 INFO  L153        SettingsManager]:  * sizeof long double=12
[2023-09-05 00:09:25,114 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2023-09-05 00:09:25,115 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2023-09-05 00:09:25,115 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2023-09-05 00:09:25,115 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2023-09-05 00:09:25,115 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2023-09-05 00:09:25,116 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2023-09-05 00:09:25,116 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-09-05 00:09:25,116 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2023-09-05 00:09:25,116 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2023-09-05 00:09:25,117 INFO  L153        SettingsManager]:  * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL
[2023-09-05 00:09:25,117 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2023-09-05 00:09:25,117 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2023-09-05 00:09:25,117 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2023-09-05 00:09:25,118 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2023-09-05 00:09:25,118 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2023-09-05 00:09:25,118 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2023-09-05 00:09:25,118 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS
[2023-09-05 00:09:25,123 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
[2023-09-05 00:09:25,310 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2023-09-05 00:09:25,328 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2023-09-05 00:09:25,330 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2023-09-05 00:09:25,330 INFO  L270        PluginConnector]: Initializing CDTParser...
[2023-09-05 00:09:25,332 INFO  L274        PluginConnector]: CDTParser initialized
[2023-09-05 00:09:25,332 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c
[2023-09-05 00:09:26,322 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2023-09-05 00:09:26,465 INFO  L384              CDTParser]: Found 1 translation units.
[2023-09-05 00:09:26,465 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c
[2023-09-05 00:09:26,473 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ac15508/7312aa9668734467bb5d3647ec425ee9/FLAG356741f53
[2023-09-05 00:09:26,483 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97ac15508/7312aa9668734467bb5d3647ec425ee9
[2023-09-05 00:09:26,484 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2023-09-05 00:09:26,485 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2023-09-05 00:09:26,486 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2023-09-05 00:09:26,486 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2023-09-05 00:09:26,488 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2023-09-05 00:09:26,489 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,489 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7abd4b56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26, skipping insertion in model container
[2023-09-05 00:09:26,489 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,503 INFO  L176         MainTranslator]: Built tables and reachable declarations
[2023-09-05 00:09:26,606 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c[2005,2018]
[2023-09-05 00:09:26,607 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-09-05 00:09:26,613 INFO  L201         MainTranslator]: Completed pre-run
[2023-09-05 00:09:26,624 WARN  L240   ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c[2005,2018]
[2023-09-05 00:09:26,625 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2023-09-05 00:09:26,629 WARN  L669               CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler.
[2023-09-05 00:09:26,630 WARN  L669               CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler.
[2023-09-05 00:09:26,634 INFO  L206         MainTranslator]: Completed translation
[2023-09-05 00:09:26,634 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26 WrapperNode
[2023-09-05 00:09:26,634 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2023-09-05 00:09:26,635 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2023-09-05 00:09:26,635 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2023-09-05 00:09:26,635 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2023-09-05 00:09:26,639 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,644 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,664 INFO  L138                Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54
[2023-09-05 00:09:26,665 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2023-09-05 00:09:26,665 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2023-09-05 00:09:26,665 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2023-09-05 00:09:26,665 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2023-09-05 00:09:26,670 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,670 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,672 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,672 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,674 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,676 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,677 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,677 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,679 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2023-09-05 00:09:26,679 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2023-09-05 00:09:26,679 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2023-09-05 00:09:26,679 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2023-09-05 00:09:26,680 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (1/1) ...
[2023-09-05 00:09:26,683 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2023-09-05 00:09:26,692 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:26,703 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2023-09-05 00:09:26,704 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2023-09-05 00:09:26,729 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2023-09-05 00:09:26,729 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2023-09-05 00:09:26,729 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2023-09-05 00:09:26,730 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2023-09-05 00:09:26,730 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2023-09-05 00:09:26,730 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2023-09-05 00:09:26,730 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2023-09-05 00:09:26,730 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2023-09-05 00:09:26,731 WARN  L210             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2023-09-05 00:09:26,801 INFO  L236             CfgBuilder]: Building ICFG
[2023-09-05 00:09:26,802 INFO  L262             CfgBuilder]: Building CFG for each procedure with an implementation
[2023-09-05 00:09:26,923 INFO  L277             CfgBuilder]: Performing block encoding
[2023-09-05 00:09:26,928 INFO  L297             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2023-09-05 00:09:26,928 INFO  L302             CfgBuilder]: Removed 2 assume(true) statements.
[2023-09-05 00:09:26,929 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:09:26 BoogieIcfgContainer
[2023-09-05 00:09:26,929 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2023-09-05 00:09:26,933 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2023-09-05 00:09:26,933 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2023-09-05 00:09:26,935 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2023-09-05 00:09:26,935 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 12:09:26" (1/3) ...
[2023-09-05 00:09:26,935 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e50961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:09:26, skipping insertion in model container
[2023-09-05 00:09:26,935 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 12:09:26" (2/3) ...
[2023-09-05 00:09:26,936 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59e50961 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 12:09:26, skipping insertion in model container
[2023-09-05 00:09:26,936 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 12:09:26" (3/3) ...
[2023-09-05 00:09:26,937 INFO  L112   eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c
[2023-09-05 00:09:26,942 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2023-09-05 00:09:26,949 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2023-09-05 00:09:26,949 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2023-09-05 00:09:26,949 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2023-09-05 00:09:26,989 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2023-09-05 00:09:27,015 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-09-05 00:09:27,016 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2023-09-05 00:09:27,016 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:27,018 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2023-09-05 00:09:27,019 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2023-09-05 00:09:27,045 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2023-09-05 00:09:27,051 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2023-09-05 00:09:27,055 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=LoopsAndPotentialCycles, 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;@2e040945, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2023-09-05 00:09:27,056 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 3 error locations.
Found a loop, use abstraction hammer
[2023-09-05 00:09:27,112 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:27,115 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:27,115 INFO  L85        PathProgramCache]: Analyzing trace with hash -1737073457, now seen corresponding path program 1 times
[2023-09-05 00:09:27,121 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:27,121 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948536635]
[2023-09-05 00:09:27,122 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:27,122 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:27,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:27,267 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:27,267 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:27,267 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948536635]
[2023-09-05 00:09:27,268 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948536635] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-05 00:09:27,268 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-05 00:09:27,268 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2023-09-05 00:09:27,269 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109040860]
[2023-09-05 00:09:27,269 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-05 00:09:27,273 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2023-09-05 00:09:27,273 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:27,287 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2023-09-05 00:09:27,287 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2023-09-05 00:09:27,288 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:27,289 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:27,289 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:27,289 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:27,335 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:27,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2023-09-05 00:09:27,335 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:27,336 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:27,336 INFO  L85        PathProgramCache]: Analyzing trace with hash -459134452, now seen corresponding path program 1 times
[2023-09-05 00:09:27,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:27,337 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323158605]
[2023-09-05 00:09:27,337 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:27,337 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:27,377 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:27,504 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:27,504 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:27,504 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323158605]
[2023-09-05 00:09:27,504 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323158605] provided 0 perfect and 1 imperfect interpolant sequences
[2023-09-05 00:09:27,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803684046]
[2023-09-05 00:09:27,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:27,505 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:27,505 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:27,543 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-09-05 00:09:27,545 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2023-09-05 00:09:27,637 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:27,639 INFO  L262         TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjunts are in the unsatisfiable core
[2023-09-05 00:09:27,642 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-09-05 00:09:27,712 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:27,712 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-09-05 00:09:27,773 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:27,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [803684046] provided 1 perfect and 1 imperfect interpolant sequences
[2023-09-05 00:09:27,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2023-09-05 00:09:27,774 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6
[2023-09-05 00:09:27,775 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590257987]
[2023-09-05 00:09:27,775 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-05 00:09:27,775 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-09-05 00:09:27,775 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:27,776 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-09-05 00:09:27,776 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2023-09-05 00:09:27,776 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:27,776 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:27,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:27,777 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:27,777 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:27,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:27,842 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:27,862 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2023-09-05 00:09:28,046 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2023-09-05 00:09:28,046 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:28,047 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:28,047 INFO  L85        PathProgramCache]: Analyzing trace with hash 2073889132, now seen corresponding path program 1 times
[2023-09-05 00:09:28,047 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:28,047 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066247041]
[2023-09-05 00:09:28,047 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:28,047 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:28,073 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:28,232 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:28,233 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:28,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066247041]
[2023-09-05 00:09:28,233 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066247041] provided 0 perfect and 1 imperfect interpolant sequences
[2023-09-05 00:09:28,233 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662281907]
[2023-09-05 00:09:28,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:28,234 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:28,234 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:28,235 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-09-05 00:09:28,237 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2023-09-05 00:09:28,299 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:28,300 INFO  L262         TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core
[2023-09-05 00:09:28,304 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-09-05 00:09:28,350 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:28,350 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-09-05 00:09:28,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:28,452 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662281907] provided 0 perfect and 2 imperfect interpolant sequences
[2023-09-05 00:09:28,453 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-09-05 00:09:28,453 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12
[2023-09-05 00:09:28,453 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769531505]
[2023-09-05 00:09:28,453 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-09-05 00:09:28,454 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2023-09-05 00:09:28,454 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:28,455 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2023-09-05 00:09:28,455 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2023-09-05 00:09:28,455 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:28,455 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:28,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:28,456 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:28,456 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:28,456 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:28,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:28,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:28,612 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-09-05 00:09:28,618 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2023-09-05 00:09:28,813 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:28,815 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:28,815 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:28,815 INFO  L85        PathProgramCache]: Analyzing trace with hash 2084851148, now seen corresponding path program 2 times
[2023-09-05 00:09:28,815 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:28,815 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491316792]
[2023-09-05 00:09:28,816 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:28,816 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:28,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:29,030 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:29,031 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:29,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491316792]
[2023-09-05 00:09:29,031 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491316792] provided 0 perfect and 1 imperfect interpolant sequences
[2023-09-05 00:09:29,031 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398115957]
[2023-09-05 00:09:29,032 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2023-09-05 00:09:29,032 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:29,032 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:29,033 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-09-05 00:09:29,066 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2023-09-05 00:09:29,102 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2023-09-05 00:09:29,103 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-09-05 00:09:29,103 INFO  L262         TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 12 conjunts are in the unsatisfiable core
[2023-09-05 00:09:29,107 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-09-05 00:09:29,153 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:29,153 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2023-09-05 00:09:29,304 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:29,305 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [398115957] provided 0 perfect and 2 imperfect interpolant sequences
[2023-09-05 00:09:29,305 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2023-09-05 00:09:29,305 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18
[2023-09-05 00:09:29,305 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083276136]
[2023-09-05 00:09:29,305 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2023-09-05 00:09:29,306 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2023-09-05 00:09:29,306 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:29,307 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2023-09-05 00:09:29,307 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306
[2023-09-05 00:09:29,307 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:29,307 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:29,307 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 4.833333333333333) internal successors, (87), 18 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:29,308 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:29,308 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:29,308 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. 
[2023-09-05 00:09:29,308 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:29,516 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:29,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:29,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2023-09-05 00:09:29,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2023-09-05 00:09:29,526 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2023-09-05 00:09:29,721 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:29,722 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:29,723 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:29,723 INFO  L85        PathProgramCache]: Analyzing trace with hash 1106802476, now seen corresponding path program 3 times
[2023-09-05 00:09:29,723 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:29,723 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329632726]
[2023-09-05 00:09:29,723 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:29,723 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:29,737 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:29,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:29,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:29,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329632726]
[2023-09-05 00:09:29,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329632726] provided 0 perfect and 1 imperfect interpolant sequences
[2023-09-05 00:09:29,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409445917]
[2023-09-05 00:09:29,902 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2023-09-05 00:09:29,902 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:29,902 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2023-09-05 00:09:29,903 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2023-09-05 00:09:29,932 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2023-09-05 00:09:29,974 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2023-09-05 00:09:29,975 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2023-09-05 00:09:29,975 INFO  L262         TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 19 conjunts are in the unsatisfiable core
[2023-09-05 00:09:29,984 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2023-09-05 00:09:30,302 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2023-09-05 00:09:30,302 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2023-09-05 00:09:30,302 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [409445917] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-05 00:09:30,303 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2023-09-05 00:09:30,303 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30
[2023-09-05 00:09:30,303 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405741384]
[2023-09-05 00:09:30,303 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-05 00:09:30,303 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2023-09-05 00:09:30,303 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:30,304 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2023-09-05 00:09:30,304 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870
[2023-09-05 00:09:30,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:30,304 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:30,304 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 4.866666666666666) internal successors, (73), 15 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:30,305 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:30,305 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2023-09-05 00:09:30,305 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. 
[2023-09-05 00:09:30,305 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. 
[2023-09-05 00:09:30,305 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:31,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:31,619 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-09-05 00:09:31,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-09-05 00:09:31,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2023-09-05 00:09:31,620 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-09-05 00:09:31,635 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2023-09-05 00:09:31,825 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2023-09-05 00:09:31,826 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:31,826 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:31,826 INFO  L85        PathProgramCache]: Analyzing trace with hash -1850831242, now seen corresponding path program 1 times
[2023-09-05 00:09:31,826 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:31,827 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197998003]
[2023-09-05 00:09:31,827 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:31,827 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:31,838 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:31,873 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:31,874 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:31,874 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197998003]
[2023-09-05 00:09:31,874 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197998003] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-05 00:09:31,874 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-05 00:09:31,874 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2023-09-05 00:09:31,874 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396608658]
[2023-09-05 00:09:31,875 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-05 00:09:31,875 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2023-09-05 00:09:31,875 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:31,875 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2023-09-05 00:09:31,876 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2023-09-05 00:09:31,876 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:31,876 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:31,876 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:31,876 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:31,876 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2023-09-05 00:09:31,876 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. 
[2023-09-05 00:09:31,876 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. 
[2023-09-05 00:09:31,877 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. 
[2023-09-05 00:09:31,877 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:32,534 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:32,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2023-09-05 00:09:32,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2023-09-05 00:09:32,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2023-09-05 00:09:32,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-09-05 00:09:32,535 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-09-05 00:09:32,535 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2023-09-05 00:09:32,535 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] ===
[2023-09-05 00:09:32,536 INFO  L145       PredicateUnifier]: Initialized classic predicate unifier
[2023-09-05 00:09:32,536 INFO  L85        PathProgramCache]: Analyzing trace with hash -1210233775, now seen corresponding path program 1 times
[2023-09-05 00:09:32,536 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2023-09-05 00:09:32,536 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478151953]
[2023-09-05 00:09:32,536 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2023-09-05 00:09:32,536 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2023-09-05 00:09:32,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2023-09-05 00:09:32,760 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2023-09-05 00:09:32,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2023-09-05 00:09:32,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478151953]
[2023-09-05 00:09:32,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478151953] provided 1 perfect and 0 imperfect interpolant sequences
[2023-09-05 00:09:32,761 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2023-09-05 00:09:32,761 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2023-09-05 00:09:32,761 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828143801]
[2023-09-05 00:09:32,761 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2023-09-05 00:09:32,762 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2023-09-05 00:09:32,762 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2023-09-05 00:09:32,762 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2023-09-05 00:09:32,762 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2023-09-05 00:09:32,762 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:32,762 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2023-09-05 00:09:32,762 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 4.071428571428571) internal successors, (57), 14 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2023-09-05 00:09:32,763 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2023-09-05 00:09:54,030 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2023-09-05 00:09:54,031 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2023-09-05 00:09:54,034 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining)
[2023-09-05 00:09:54,034 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining)
[2023-09-05 00:09:54,034 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining)
[2023-09-05 00:09:54,035 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2023-09-05 00:09:54,046 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2023-09-05 00:09:54,051 INFO  L228   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2023-09-05 00:09:54,051 INFO  L178   ceAbstractionStarter]: Computing trace abstraction results
[2023-09-05 00:09:54,054 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.09 12:09:54 BasicIcfg
[2023-09-05 00:09:54,054 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2023-09-05 00:09:54,055 INFO  L158              Benchmark]: Toolchain (without parser) took 27569.41ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 191.3MB in the beginning and 208.2MB in the end (delta: -16.9MB). Peak memory consumption was 189.1MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,055 INFO  L158              Benchmark]: CDTParser took 0.10ms. Allocated memory is still 174.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 7.0GB.
[2023-09-05 00:09:54,055 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 148.65ms. Allocated memory is still 232.8MB. Free memory was 191.3MB in the beginning and 180.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,056 INFO  L158              Benchmark]: Boogie Procedure Inliner took 29.56ms. Allocated memory is still 232.8MB. Free memory was 180.3MB in the beginning and 179.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,056 INFO  L158              Benchmark]: Boogie Preprocessor took 13.63ms. Allocated memory is still 232.8MB. Free memory was 179.1MB in the beginning and 177.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,056 INFO  L158              Benchmark]: RCFGBuilder took 250.39ms. Allocated memory is still 232.8MB. Free memory was 177.6MB in the beginning and 165.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,056 INFO  L158              Benchmark]: TraceAbstraction took 27121.58ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 164.5MB in the beginning and 208.2MB in the end (delta: -43.7MB). Peak memory consumption was 161.9MB. Max. memory is 7.0GB.
[2023-09-05 00:09:54,058 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.10ms. Allocated memory is still 174.1MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 7.0GB.
 * CACSL2BoogieTranslator took 148.65ms. Allocated memory is still 232.8MB. Free memory was 191.3MB in the beginning and 180.3MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 7.0GB.
 * Boogie Procedure Inliner took 29.56ms. Allocated memory is still 232.8MB. Free memory was 180.3MB in the beginning and 179.1MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB.
 * Boogie Preprocessor took 13.63ms. Allocated memory is still 232.8MB. Free memory was 179.1MB in the beginning and 177.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 7.0GB.
 * RCFGBuilder took 250.39ms. Allocated memory is still 232.8MB. Free memory was 177.6MB in the beginning and 165.0MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 7.0GB.
 * TraceAbstraction took 27121.58ms. Allocated memory was 232.8MB in the beginning and 280.0MB in the end (delta: 47.2MB). Free memory was 164.5MB in the beginning and 208.2MB in the end (delta: -43.7MB). Peak memory consumption was 161.9MB. Max. memory is 7.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8892, independent: 8359, independent conditional: 8359, independent unconditional: 0, dependent: 533, dependent conditional: 533, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 8359, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 8359, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 0, independent unconditional: 8359, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 0, independent unconditional: 8359, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 0, independent unconditional: 8359, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 8359, independent: 8359, independent conditional: 0, independent unconditional: 8359, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 8359, independent: 8314, independent conditional: 0, independent unconditional: 8314, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 45, independent: 45, independent conditional: 0, independent unconditional: 45, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 64, independent: 64, independent conditional: 0, independent unconditional: 64, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8359, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8359, unknown conditional: 0, unknown unconditional: 8359] , Statistics on independence cache: Total cache size (in pairs): 8359, Positive cache size: 8359, Positive conditional cache size: 0, Positive unconditional cache size: 8359, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: 0, Independence queries for same thread: 533
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 9
  - PositiveResult [Line: 79]: call to reach_error is unreachable
    For all program executions holds that call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances
    CFG has 5 procedures, 98 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 27.0s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 23.8s, 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: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 761 NumberOfCodeBlocks, 749 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 954 ConstructedInterpolants, 0 QuantifiedInterpolants, 2118 SizeOfPredicates, 26 NumberOfNonLiveVariables, 634 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 14 InterpolantComputations, 5 PerfectInterpolantSequences, 95/174 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
  - AllSpecificationsHoldResult: All specifications hold
    1 specifications checked. All of them hold
RESULT: Ultimate proved your program to be correct!
[2023-09-05 00:09:54,081 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2023-09-05 00:09:54,279 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0
Received shutdown request...