/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --traceabstraction.prune.known.deadend.states.from.previous.iterations false -s ../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf --traceabstraction.cegar.restart.behaviour ONE_CEGAR_PER_ERROR_LOCATION -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c


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


This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m
[2024-01-26 02:13:25,773 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-01-26 02:13:25,809 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf
[2024-01-26 02:13:25,812 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-01-26 02:13:25,812 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-01-26 02:13:25,812 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2024-01-26 02:13:25,825 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-01-26 02:13:25,826 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-01-26 02:13:25,826 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-01-26 02:13:25,826 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-01-26 02:13:25,826 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-01-26 02:13:25,827 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-01-26 02:13:25,827 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-01-26 02:13:25,827 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-01-26 02:13:25,827 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-01-26 02:13:25,828 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-01-26 02:13:25,828 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-01-26 02:13:25,828 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-01-26 02:13:25,828 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-01-26 02:13:25,829 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-01-26 02:13:25,829 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-01-26 02:13:25,829 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-01-26 02:13:25,829 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-01-26 02:13:25,830 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-01-26 02:13:25,830 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-01-26 02:13:25,830 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-01-26 02:13:25,830 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-01-26 02:13:25,830 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-01-26 02:13:25,830 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2024-01-26 02:13:25,831 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-01-26 02:13:25,831 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 02:13:25,831 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-01-26 02:13:25,831 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-01-26 02:13:25,831 INFO  L153        SettingsManager]:  * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-01-26 02:13:25,832 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS
[2024-01-26 02:13:25,833 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Prune known deadend states from previous iterations -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: CEGAR restart behaviour -> ONE_CEGAR_PER_ERROR_LOCATION
[2024-01-26 02:13:25,971 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-01-26 02:13:25,988 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-01-26 02:13:25,990 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-01-26 02:13:25,991 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-01-26 02:13:25,991 INFO  L274        PluginConnector]: CDTParser initialized
[2024-01-26 02:13:25,991 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/test-easy11.wvr.c
[2024-01-26 02:13:27,017 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-01-26 02:13:27,166 INFO  L384              CDTParser]: Found 1 translation units.
[2024-01-26 02:13:27,166 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/test-easy11.wvr.c
[2024-01-26 02:13:27,171 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/79b271072/0a290df9adb04bc58a9df5af7e5c4c42/FLAGc43d1e4b9
[2024-01-26 02:13:27,188 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/79b271072/0a290df9adb04bc58a9df5af7e5c4c42
[2024-01-26 02:13:27,190 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-01-26 02:13:27,192 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-01-26 02:13:27,193 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-01-26 02:13:27,193 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-01-26 02:13:27,197 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-01-26 02:13:27,198 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,198 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6064fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27, skipping insertion in model container
[2024-01-26 02:13:27,198 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,214 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-01-26 02:13:27,316 WARN  L239   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[2031,2044]
[2024-01-26 02:13:27,319 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 02:13:27,324 INFO  L202         MainTranslator]: Completed pre-run
[2024-01-26 02:13:27,339 WARN  L239   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[2031,2044]
[2024-01-26 02:13:27,340 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 02:13:27,349 INFO  L206         MainTranslator]: Completed translation
[2024-01-26 02:13:27,349 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27 WrapperNode
[2024-01-26 02:13:27,350 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-01-26 02:13:27,350 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-01-26 02:13:27,350 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-01-26 02:13:27,350 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-01-26 02:13:27,355 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,359 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,369 INFO  L138                Inliner]: procedures = 21, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 53
[2024-01-26 02:13:27,370 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-01-26 02:13:27,370 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-01-26 02:13:27,370 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-01-26 02:13:27,370 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-01-26 02:13:27,376 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,376 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,377 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,377 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,380 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,382 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,388 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,389 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,390 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-01-26 02:13:27,391 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-01-26 02:13:27,391 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-01-26 02:13:27,391 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-01-26 02:13:27,391 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (1/1) ...
[2024-01-26 02:13:27,399 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 02:13:27,410 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:27,421 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-01-26 02:13:27,426 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2024-01-26 02:13:27,444 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2024-01-26 02:13:27,444 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-01-26 02:13:27,444 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-01-26 02:13:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2024-01-26 02:13:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2024-01-26 02:13:27,445 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-01-26 02:13:27,446 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-01-26 02:13:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-01-26 02:13:27,446 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-01-26 02:13:27,447 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-01-26 02:13:27,533 INFO  L241             CfgBuilder]: Building ICFG
[2024-01-26 02:13:27,535 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-01-26 02:13:27,681 INFO  L282             CfgBuilder]: Performing block encoding
[2024-01-26 02:13:27,687 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-01-26 02:13:27,687 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-01-26 02:13:27,688 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:13:27 BoogieIcfgContainer
[2024-01-26 02:13:27,688 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-01-26 02:13:27,689 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-01-26 02:13:27,689 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-01-26 02:13:27,691 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-01-26 02:13:27,691 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 02:13:27" (1/3) ...
[2024-01-26 02:13:27,692 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e11900f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:13:27, skipping insertion in model container
[2024-01-26 02:13:27,692 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 02:13:27" (2/3) ...
[2024-01-26 02:13:27,692 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e11900f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 02:13:27, skipping insertion in model container
[2024-01-26 02:13:27,692 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 02:13:27" (3/3) ...
[2024-01-26 02:13:27,693 INFO  L112   eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c
[2024-01-26 02:13:27,701 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-01-26 02:13:27,708 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-01-26 02:13:27,708 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-01-26 02:13:27,708 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-01-26 02:13:27,777 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-01-26 02:13:27,814 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:27,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-01-26 02:13:27,815 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:27,817 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-01-26 02:13:27,847 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process
[2024-01-26 02:13:27,865 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-01-26 02:13:27,871 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ========
[2024-01-26 02:13:27,876 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;@57de93db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:27,876 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
Found a loop, use abstraction hammer
[2024-01-26 02:13:27,947 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:27,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:27,950 INFO  L85        PathProgramCache]: Analyzing trace with hash -886426312, now seen corresponding path program 1 times
[2024-01-26 02:13:27,956 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:27,956 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605788354]
[2024-01-26 02:13:27,957 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:27,957 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:28,040 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:28,093 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:28,093 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:28,093 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605788354]
[2024-01-26 02:13:28,094 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605788354] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:13:28,094 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:13:28,094 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-01-26 02:13:28,095 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960771911]
[2024-01-26 02:13:28,095 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:13:28,099 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-01-26 02:13:28,099 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:28,112 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-01-26 02:13:28,113 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-01-26 02:13:28,113 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:28,114 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:28,115 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:28,115 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
[2024-01-26 02:13:28,157 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:28,157 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-01-26 02:13:28,157 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:28,158 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:28,158 INFO  L85        PathProgramCache]: Analyzing trace with hash -1699838185, now seen corresponding path program 1 times
[2024-01-26 02:13:28,158 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:28,158 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007226698]
[2024-01-26 02:13:28,158 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:28,158 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:28,191 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:28,313 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:28,313 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:28,313 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007226698]
[2024-01-26 02:13:28,313 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007226698] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:13:28,314 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307154348]
[2024-01-26 02:13:28,314 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:28,314 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:28,314 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:28,372 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-01-26 02:13:28,413 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-01-26 02:13:28,446 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:28,447 INFO  L262         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-01-26 02:13:28,451 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 02:13:28,497 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:28,497 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 02:13:28,533 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:28,533 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [307154348] provided 1 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:13:28,534 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences.
[2024-01-26 02:13:28,534 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6
[2024-01-26 02:13:28,534 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904126282]
[2024-01-26 02:13:28,535 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:13:28,535 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-01-26 02:13:28,535 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:28,536 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-01-26 02:13:28,536 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30
[2024-01-26 02:13:28,536 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:28,536 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:28,537 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:28,537 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:28,537 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
[2024-01-26 02:13:28,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:28,592 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:28,600 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-01-26 02:13:28,797 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2024-01-26 02:13:28,798 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:28,799 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:28,799 INFO  L85        PathProgramCache]: Analyzing trace with hash 26903629, now seen corresponding path program 1 times
[2024-01-26 02:13:28,800 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:28,800 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209806993]
[2024-01-26 02:13:28,800 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:28,800 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:28,841 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:28,974 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:28,974 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:28,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209806993]
[2024-01-26 02:13:28,974 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209806993] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:13:28,974 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742335727]
[2024-01-26 02:13:28,974 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:28,975 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:28,975 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:28,976 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-01-26 02:13:29,004 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-01-26 02:13:29,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:29,050 INFO  L262         TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core
[2024-01-26 02:13:29,052 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 02:13:29,082 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:29,082 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 02:13:29,159 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:29,160 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1742335727] provided 0 perfect and 2 imperfect interpolant sequences
[2024-01-26 02:13:29,160 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-01-26 02:13:29,160 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12
[2024-01-26 02:13:29,160 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317533538]
[2024-01-26 02:13:29,160 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-01-26 02:13:29,160 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-01-26 02:13:29,161 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:29,161 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-01-26 02:13:29,161 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132
[2024-01-26 02:13:29,161 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:29,161 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:29,162 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:29,162 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:29,162 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:29,162 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
[2024-01-26 02:13:29,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:29,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:29,309 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-01-26 02:13:29,318 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0
[2024-01-26 02:13:29,514 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:29,514 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:29,515 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:29,515 INFO  L85        PathProgramCache]: Analyzing trace with hash 715393923, now seen corresponding path program 2 times
[2024-01-26 02:13:29,515 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:29,515 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828682094]
[2024-01-26 02:13:29,515 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:29,516 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:29,546 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:29,733 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:29,734 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:29,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828682094]
[2024-01-26 02:13:29,734 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828682094] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:13:29,734 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085778592]
[2024-01-26 02:13:29,734 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-01-26 02:13:29,734 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:29,734 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:29,750 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-01-26 02:13:29,772 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-01-26 02:13:29,809 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-01-26 02:13:29,809 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-01-26 02:13:29,810 INFO  L262         TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 12 conjunts are in the unsatisfiable core
[2024-01-26 02:13:29,814 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 02:13:29,859 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:29,859 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 02:13:29,993 INFO  L134       CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:29,993 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085778592] provided 0 perfect and 2 imperfect interpolant sequences
[2024-01-26 02:13:29,993 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-01-26 02:13:29,993 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18
[2024-01-26 02:13:29,993 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345478085]
[2024-01-26 02:13:29,994 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-01-26 02:13:29,994 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 18 states
[2024-01-26 02:13:29,994 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:29,994 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants.
[2024-01-26 02:13:29,995 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306
[2024-01-26 02:13:29,995 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:29,995 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:29,995 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 18 states, 18 states have (on average 5.055555555555555) internal successors, (91), 18 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:29,995 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:29,995 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:29,995 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. 
[2024-01-26 02:13:29,995 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
[2024-01-26 02:13:30,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:30,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:30,199 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-01-26 02:13:30,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-01-26 02:13:30,207 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-01-26 02:13:30,404 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:30,405 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:30,406 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:30,406 INFO  L85        PathProgramCache]: Analyzing trace with hash 1511070905, now seen corresponding path program 3 times
[2024-01-26 02:13:30,406 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:30,406 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637257348]
[2024-01-26 02:13:30,406 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:30,407 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:30,442 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:30,641 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:30,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:30,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637257348]
[2024-01-26 02:13:30,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637257348] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 02:13:30,642 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678654008]
[2024-01-26 02:13:30,642 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-01-26 02:13:30,642 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:30,642 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:30,643 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-01-26 02:13:30,679 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-01-26 02:13:30,716 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s)
[2024-01-26 02:13:30,717 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-01-26 02:13:30,717 INFO  L262         TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 19 conjunts are in the unsatisfiable core
[2024-01-26 02:13:30,725 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 02:13:30,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 43 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked.
[2024-01-26 02:13:30,967 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-01-26 02:13:30,967 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678654008] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:13:30,968 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-01-26 02:13:30,968 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [17] total 30
[2024-01-26 02:13:30,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477146970]
[2024-01-26 02:13:30,968 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:13:30,968 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-01-26 02:13:30,968 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:30,969 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-01-26 02:13:30,969 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870
[2024-01-26 02:13:30,969 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:30,969 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:30,969 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 5.133333333333334) internal successors, (77), 15 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:30,970 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:30,970 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. 
[2024-01-26 02:13:30,970 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 14 states. 
[2024-01-26 02:13:30,970 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 21 states. 
[2024-01-26 02:13:30,970 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
[2024-01-26 02:13:32,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-01-26 02:13:32,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-01-26 02:13:32,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-01-26 02:13:32,026 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-01-26 02:13:32,033 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0
[2024-01-26 02:13:32,231 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 02:13:32,231 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:32,231 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:32,231 INFO  L85        PathProgramCache]: Analyzing trace with hash 1728383319, now seen corresponding path program 1 times
[2024-01-26 02:13:32,232 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:32,232 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847042549]
[2024-01-26 02:13:32,232 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:32,232 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:32,239 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:32,263 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:32,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:32,264 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847042549]
[2024-01-26 02:13:32,264 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847042549] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:13:32,264 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:13:32,264 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-01-26 02:13:32,264 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973826087]
[2024-01-26 02:13:32,264 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:13:32,264 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-01-26 02:13:32,265 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:32,265 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-01-26 02:13:32,265 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-01-26 02:13:32,265 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,265 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:32,265 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-01-26 02:13:32,265 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,265 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-01-26 02:13:32,266 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. 
[2024-01-26 02:13:32,266 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. 
[2024-01-26 02:13:32,266 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. 
[2024-01-26 02:13:32,266 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
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. 
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-01-26 02:13:32,731 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-01-26 02:13:32,731 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-01-26 02:13:32,731 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 02:13:32,732 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 02:13:32,732 INFO  L85        PathProgramCache]: Analyzing trace with hash -1930024612, now seen corresponding path program 1 times
[2024-01-26 02:13:32,732 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 02:13:32,732 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130237330]
[2024-01-26 02:13:32,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 02:13:32,732 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 02:13:32,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 02:13:32,901 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-01-26 02:13:32,902 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 02:13:32,902 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130237330]
[2024-01-26 02:13:32,902 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130237330] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 02:13:32,902 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 02:13:32,902 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14
[2024-01-26 02:13:32,902 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778541875]
[2024-01-26 02:13:32,902 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 02:13:32,902 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-01-26 02:13:32,902 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 02:13:32,903 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-01-26 02:13:32,903 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182
[2024-01-26 02:13:32,903 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,903 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 02:13:32,903 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 4.357142857142857) internal successors, (61), 14 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)
[2024-01-26 02:13:32,903 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:32,903 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. 
[2024-01-26 02:13:32,903 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 23 states. 
[2024-01-26 02:13:32,903 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 37 states. 
[2024-01-26 02:13:32,904 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 19 states. 
[2024-01-26 02:13:32,904 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. 
[2024-01-26 02:13:32,904 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
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:13:51,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 02:13:51,723 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-01-26 02:13:51,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-01-26 02:13:51,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2024-01-26 02:13:51,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-01-26 02:13:51,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-01-26 02:13:51,724 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-01-26 02:13:51,726 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-01-26 02:13:51,726 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-01-26 02:13:51,743 INFO  L445         BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1]
[2024-01-26 02:13:51,744 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was SAFE (1/3)
[2024-01-26 02:13:51,748 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:51,748 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-01-26 02:13:51,749 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:51,750 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-01-26 02:13:51,750 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Waiting until timeout for monitored process
[2024-01-26 02:13:51,772 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-01-26 02:13:51,772 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ========
[2024-01-26 02:13:51,772 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;@57de93db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:51,772 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
[2024-01-26 02:13:51,802 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining)
[2024-01-26 02:13:51,804 INFO  L445         BasicCegarLoop]: Path program histogram: []
[2024-01-26 02:13:51,804 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (2/3)
[2024-01-26 02:13:51,809 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:51,809 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-01-26 02:13:51,809 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 02:13:51,826 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null)
[2024-01-26 02:13:51,838 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-01-26 02:13:51,838 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES ========
[2024-01-26 02:13:51,838 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;@57de93db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 02:13:51,838 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
Found a loop, use abstraction hammer
[2024-01-26 02:13:51,850 INFO  L805   garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 1 remaining)
[2024-01-26 02:13:51,850 INFO  L445         BasicCegarLoop]: Path program histogram: []
[2024-01-26 02:13:51,851 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES was SAFE (3/3)
[2024-01-26 02:13:51,851 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-01-26 02:13:51,851 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2024-01-26 02:13:51,854 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 02:13:51 BasicIcfg
[2024-01-26 02:13:51,854 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-01-26 02:13:51,854 INFO  L158              Benchmark]: Toolchain (without parser) took 24662.46ms. Allocated memory was 231.7MB in the beginning and 395.3MB in the end (delta: 163.6MB). Free memory was 187.1MB in the beginning and 220.1MB in the end (delta: -33.0MB). Peak memory consumption was 131.6MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,854 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-01-26 02:13:51,854 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 156.48ms. Allocated memory is still 231.7MB. Free memory was 186.6MB in the beginning and 175.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,855 INFO  L158              Benchmark]: Boogie Procedure Inliner took 19.51ms. Allocated memory is still 231.7MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,855 INFO  L158              Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 231.7MB. Free memory was 174.0MB in the beginning and 172.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,855 INFO  L158              Benchmark]: RCFGBuilder took 297.08ms. Allocated memory is still 231.7MB. Free memory was 172.4MB in the beginning and 159.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,855 INFO  L158              Benchmark]: TraceAbstraction took 24164.60ms. Allocated memory was 231.7MB in the beginning and 395.3MB in the end (delta: 163.6MB). Free memory was 158.8MB in the beginning and 220.1MB in the end (delta: -61.3MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB.
[2024-01-26 02:13:51,857 INFO  L338   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.11ms. Allocated memory is still 192.9MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 156.48ms. Allocated memory is still 231.7MB. Free memory was 186.6MB in the beginning and 175.6MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 19.51ms. Allocated memory is still 231.7MB. Free memory was 175.6MB in the beginning and 174.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 20.05ms. Allocated memory is still 231.7MB. Free memory was 174.0MB in the beginning and 172.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 297.08ms. Allocated memory is still 231.7MB. Free memory was 172.4MB in the beginning and 159.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 24164.60ms. Allocated memory was 231.7MB in the beginning and 395.3MB in the end (delta: 163.6MB). Free memory was 158.8MB in the beginning and 220.1MB in the end (delta: -61.3MB). Peak memory consumption was 103.3MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 9445, independent: 8904, independent conditional: 8904, independent unconditional: 0, dependent: 541, dependent conditional: 541, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 8904, independent: 8904, independent conditional: 8904, 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: 8904, independent: 8904, independent conditional: 8904, 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: 8904, independent: 8904, independent conditional: 0, independent unconditional: 8904, 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: 8904, independent: 8904, independent conditional: 0, independent unconditional: 8904, 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: 8904, independent: 8904, independent conditional: 0, independent unconditional: 8904, 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: 8904, independent: 8904, independent conditional: 0, independent unconditional: 8904, 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: 8904, independent: 8858, independent conditional: 0, independent unconditional: 8858, dependent: 46, dependent conditional: 0, dependent unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, 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: 46, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 51, independent: 51, independent conditional: 0, independent unconditional: 51, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 8904, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 8904, unknown conditional: 0, unknown unconditional: 8904] , Statistics on independence cache: Total cache size (in pairs): 8904, Positive cache size: 8904, Positive conditional cache size: 0, Positive unconditional cache size: 8904, 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: 541
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 8, RedundantProofs: 1, ProvenStates: 1614, Times there's more than one choice: 1339, Avg number of choices: 4.799256505576208
  - StatisticsResult: Reduction benchmarks
[2024-01-26 02:13:51,862 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Waiting until timeout for monitored process
    0.1s Time before loop, 18.7s Time in loop, 18.8s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~mem9#1, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), write~int_#ptr.base, thread1_~x~0, thread2_~x~1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, thread2Thread1of1ForFork0_#res.offset, read~int_#ptr.base, ULTIMATE.start_#t~ret10#1, thread1Thread1of1ForFork1_~x~0, thread1_#res.offset, thread2_#res.offset, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_#in~_argptr.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork1_#res.offset, thread1_~_argptr.offset, thread2_~_argptr.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread1_#in~_argptr.base, thread2_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.base, ULTIMATE.start_main_~#t1~0#1.offset, thread1Thread1of1ForFork1_~_argptr.offset, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, write~int_#value, write~init~int_#ptr.offset, thread1_~_argptr.base, thread2_~_argptr.base, ULTIMATE.dealloc_~addr.base, thread1Thread1of1ForFork1_thidvar0, old(thread1Thread1of1ForFork1_thidvar0), thread1Thread1of1ForFork1_thidvar1, old(thread1Thread1of1ForFork1_thidvar1), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), ~X~0, old(~X~0), ~Y~0, old(~Y~0), thread1Thread1of1ForFork1_~_argptr.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork0_#res.base, write~init~int_#ptr.base, thread2Thread1of1ForFork0_#in~_argptr.offset, thread1_#res.base, thread2_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork0_#t~post2, #length, old(#length), ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_#in~_argptr.offset, thread2_#in~_argptr.offset, #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork1_#res.base, thread1_#t~post1, thread2_#t~post2, thread1Thread1of1ForFork1_#in~_argptr.offset, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~pre6#1, #memory_int, old(#memory_int), thread1Thread1of1ForFork1_#t~post1, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork0_~x~1, read~int_#ptr.offset], Protected Variables before encountering a loop: []
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 159, independent: 140, independent conditional: 140, independent unconditional: 0, dependent: 19, dependent conditional: 19, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 140, independent: 140, independent conditional: 140, 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: 140, independent: 140, independent conditional: 140, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, 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: 140, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 140, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 140, unknown conditional: 0, unknown unconditional: 140] , Statistics on independence cache: Total cache size (in pairs): 140, Positive cache size: 140, Positive conditional cache size: 0, Positive unconditional cache size: 140, 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: 19
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN
  - StatisticsResult: Reduction benchmarks
    0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~mem9#1, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), write~int_#ptr.base, thread1_~x~0, thread2_~x~1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, thread2Thread1of1ForFork0_#res.offset, read~int_#ptr.base, ULTIMATE.start_#t~ret10#1, thread1Thread1of1ForFork1_~x~0, thread1_#res.offset, thread2_#res.offset, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_#in~_argptr.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork1_#res.offset, thread1_~_argptr.offset, thread2_~_argptr.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread1_#in~_argptr.base, thread2_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.base, ULTIMATE.start_main_~#t1~0#1.offset, thread1Thread1of1ForFork1_~_argptr.offset, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, write~int_#value, write~init~int_#ptr.offset, thread1_~_argptr.base, thread2_~_argptr.base, ULTIMATE.dealloc_~addr.base, thread1Thread1of1ForFork1_thidvar0, old(thread1Thread1of1ForFork1_thidvar0), thread1Thread1of1ForFork1_thidvar1, old(thread1Thread1of1ForFork1_thidvar1), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), ~X~0, old(~X~0), ~Y~0, old(~Y~0), thread1Thread1of1ForFork1_~_argptr.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork0_#res.base, write~init~int_#ptr.base, thread2Thread1of1ForFork0_#in~_argptr.offset, thread1_#res.base, thread2_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork0_#t~post2, #length, old(#length), ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_#in~_argptr.offset, thread2_#in~_argptr.offset, #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork1_#res.base, thread1_#t~post1, thread2_#t~post2, thread1Thread1of1ForFork1_#in~_argptr.offset, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~pre6#1, #memory_int, old(#memory_int), thread1Thread1of1ForFork1_#t~post1, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork0_~x~1, read~int_#ptr.offset], Protected Variables before encountering a loop: []
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1, dependent conditional: 1, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, 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: 0, independent: 0, independent conditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, 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: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Statistics on independence cache: Total cache size (in pairs): 0, Positive cache size: 0, Positive conditional cache size: 0, Positive unconditional cache size: 0, 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: -1, Independence queries for same thread: 1
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 0, RedundantProofs: 0, ProvenStates: 0, Times there's more than one choice: 0, Avg number of choices: NaN
  - StatisticsResult: Reduction benchmarks
    0.0s Time before loop, 0.0s Time in loop, 0.0s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ULTIMATE.start_main_#t~mem8#1, ULTIMATE.start_main_#t~mem9#1, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), write~int_#ptr.base, thread1_~x~0, thread2_~x~1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~nondet3#1, ULTIMATE.start_main_#t~nondet5#1, ULTIMATE.start_main_#t~nondet7#1, thread2Thread1of1ForFork0_#res.offset, read~int_#ptr.base, ULTIMATE.start_#t~ret10#1, thread1Thread1of1ForFork1_~x~0, thread1_#res.offset, thread2_#res.offset, thread2Thread1of1ForFork0_~_argptr.offset, thread2Thread1of1ForFork0_#in~_argptr.base, ULTIMATE.start_main_~#t2~0#1.offset, #Ultimate.allocOnStack_~size, thread1Thread1of1ForFork1_#res.offset, thread1_~_argptr.offset, thread2_~_argptr.offset, read~int_#sizeOfReadType, write~init~int_#sizeOfWrittenType, thread1_#in~_argptr.base, thread2_#in~_argptr.base, thread2Thread1of1ForFork0_~_argptr.base, ULTIMATE.start_main_~#t1~0#1.offset, thread1Thread1of1ForFork1_~_argptr.offset, #Ultimate.allocOnStack_#res.offset, ULTIMATE.dealloc_~addr.offset, thread1Thread1of1ForFork1_#in~_argptr.base, write~int_#value, write~init~int_#ptr.offset, thread1_~_argptr.base, thread2_~_argptr.base, ULTIMATE.dealloc_~addr.base, thread1Thread1of1ForFork1_thidvar0, old(thread1Thread1of1ForFork1_thidvar0), thread1Thread1of1ForFork1_thidvar1, old(thread1Thread1of1ForFork1_thidvar1), ULTIMATE.start_assume_abort_if_not_~cond#1, #pthreadsForks, old(#pthreadsForks), ~X~0, old(~X~0), ~Y~0, old(~Y~0), thread1Thread1of1ForFork1_~_argptr.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread2Thread1of1ForFork0_#res.base, write~init~int_#ptr.base, thread2Thread1of1ForFork0_#in~_argptr.offset, thread1_#res.base, thread2_#res.base, ULTIMATE.start_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_~#t1~0#1.base, thread2Thread1of1ForFork0_#t~post2, #length, old(#length), ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_#in~_argptr.offset, thread2_#in~_argptr.offset, #StackHeapBarrier, old(#StackHeapBarrier), thread1Thread1of1ForFork1_#res.base, thread1_#t~post1, thread2_#t~post2, thread1Thread1of1ForFork1_#in~_argptr.offset, write~int_#ptr.offset, ULTIMATE.start_main_#t~pre4#1, ULTIMATE.start_main_#t~pre6#1, #memory_int, old(#memory_int), thread1Thread1of1ForFork1_#t~post1, #Ultimate.allocOnStack_#res.base, thread2Thread1of1ForFork0_~x~1, read~int_#ptr.offset], Protected Variables before encountering a loop: []
  - PositiveResult [Line: 79]: a call to reach_error is unreachable
    For all program executions holds that a call to reach_error is unreachable at this location
  - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances
    CFG has 5 procedures, 105 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 23.9s, OverallIterations: 7, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 20.9s, 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.5s InterpolantComputationTime, 805 NumberOfCodeBlocks, 793 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1010 ConstructedInterpolants, 0 QuantifiedInterpolants, 2099 SizeOfPredicates, 26 NumberOfNonLiveVariables, 694 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
  - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances
    CFG has 5 procedures, 105 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: No data available, ReuseStatistics: No data available
  - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency: ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES with 1 thread instances
    CFG has 5 procedures, 105 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, 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: 0, 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: 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!
[2024-01-26 02:13:51,882 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (8)] Forceful destruction successful, exit code 0
[2024-01-26 02:13:52,084 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (7)] Ended with exit code 0
[2024-01-26 02:13:52,285 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0
[2024-01-26 02:13:52,488 INFO  L540       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...