/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/chl-nzb-file-symm.wvr.c


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


This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-57af04c-m
[2024-01-26 00:33:02,500 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-01-26 00:33:02,572 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf
[2024-01-26 00:33:02,576 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-01-26 00:33:02,577 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-01-26 00:33:02,577 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty.
[2024-01-26 00:33:02,599 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-01-26 00:33:02,600 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-01-26 00:33:02,600 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-01-26 00:33:02,603 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-01-26 00:33:02,603 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-01-26 00:33:02,603 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-01-26 00:33:02,603 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-01-26 00:33:02,604 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-01-26 00:33:02,604 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-01-26 00:33:02,605 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-01-26 00:33:02,606 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-01-26 00:33:02,606 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-01-26 00:33:02,606 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-01-26 00:33:02,606 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-01-26 00:33:02,606 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-01-26 00:33:02,607 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-01-26 00:33:02,607 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-01-26 00:33:02,607 INFO  L153        SettingsManager]:  * To the following directory=./dump/
[2024-01-26 00:33:02,607 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 00:33:02,608 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-01-26 00:33:02,608 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-01-26 00:33:02,609 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-01-26 00:33:02,609 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA
[2024-01-26 00:33:02,609 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-01-26 00:33:02,609 INFO  L153        SettingsManager]:  * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS
[2024-01-26 00:33:02,610 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 00:33:02,797 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-01-26 00:33:02,816 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-01-26 00:33:02,818 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-01-26 00:33:02,818 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-01-26 00:33:02,819 INFO  L274        PluginConnector]: CDTParser initialized
[2024-01-26 00:33:02,819 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c
[2024-01-26 00:33:03,933 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-01-26 00:33:04,092 INFO  L384              CDTParser]: Found 1 translation units.
[2024-01-26 00:33:04,092 INFO  L180              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-nzb-file-symm.wvr.c
[2024-01-26 00:33:04,101 INFO  L427              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8b3d1dc0a/1c1f53aebdc14c3b970b561a3a98e8b4/FLAG460cdb764
[2024-01-26 00:33:04,117 INFO  L435              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/8b3d1dc0a/1c1f53aebdc14c3b970b561a3a98e8b4
[2024-01-26 00:33:04,119 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-01-26 00:33:04,120 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2024-01-26 00:33:04,121 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-01-26 00:33:04,121 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-01-26 00:33:04,125 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-01-26 00:33:04,125 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,127 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68980ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04, skipping insertion in model container
[2024-01-26 00:33:04,127 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,152 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-01-26 00:33:04,287 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/chl-nzb-file-symm.wvr.c[4955,4968]
[2024-01-26 00:33:04,295 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 00:33:04,302 INFO  L202         MainTranslator]: Completed pre-run
[2024-01-26 00:33:04,327 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/chl-nzb-file-symm.wvr.c[4955,4968]
[2024-01-26 00:33:04,331 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-01-26 00:33:04,343 INFO  L206         MainTranslator]: Completed translation
[2024-01-26 00:33:04,343 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04 WrapperNode
[2024-01-26 00:33:04,343 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-01-26 00:33:04,344 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-01-26 00:33:04,344 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-01-26 00:33:04,344 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-01-26 00:33:04,349 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,356 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,392 INFO  L138                Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 21, calls inlined = 29, statements flattened = 409
[2024-01-26 00:33:04,392 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-01-26 00:33:04,393 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-01-26 00:33:04,393 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-01-26 00:33:04,393 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-01-26 00:33:04,399 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,399 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,403 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,404 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,414 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,418 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,420 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,421 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,448 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-01-26 00:33:04,449 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-01-26 00:33:04,449 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-01-26 00:33:04,449 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-01-26 00:33:04,450 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (1/1) ...
[2024-01-26 00:33:04,453 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-01-26 00:33:04,460 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:04,497 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 00:33:04,517 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 00:33:04,528 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-01-26 00:33:04,528 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-01-26 00:33:04,528 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-01-26 00:33:04,528 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-01-26 00:33:04,529 INFO  L130     BoogieDeclarations]: Found specification of procedure thread1
[2024-01-26 00:33:04,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread1
[2024-01-26 00:33:04,529 INFO  L130     BoogieDeclarations]: Found specification of procedure thread2
[2024-01-26 00:33:04,529 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread2
[2024-01-26 00:33:04,529 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-01-26 00:33:04,529 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-01-26 00:33:04,529 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-01-26 00:33:04,531 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-01-26 00:33:04,531 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-01-26 00:33:04,532 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 00:33:04,646 INFO  L241             CfgBuilder]: Building ICFG
[2024-01-26 00:33:04,648 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-01-26 00:33:05,046 INFO  L282             CfgBuilder]: Performing block encoding
[2024-01-26 00:33:05,066 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-01-26 00:33:05,067 INFO  L309             CfgBuilder]: Removed 4 assume(true) statements.
[2024-01-26 00:33:05,067 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:33:05 BoogieIcfgContainer
[2024-01-26 00:33:05,067 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-01-26 00:33:05,089 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-01-26 00:33:05,089 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-01-26 00:33:05,091 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-01-26 00:33:05,091 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.01 12:33:04" (1/3) ...
[2024-01-26 00:33:05,092 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:33:05, skipping insertion in model container
[2024-01-26 00:33:05,092 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.01 12:33:04" (2/3) ...
[2024-01-26 00:33:05,092 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dfe3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.01 12:33:05, skipping insertion in model container
[2024-01-26 00:33:05,093 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.01 12:33:05" (3/3) ...
[2024-01-26 00:33:05,094 INFO  L112   eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c
[2024-01-26 00:33:05,100 WARN  L146   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-01-26 00:33:05,108 INFO  L204   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-01-26 00:33:05,109 INFO  L163   ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-01-26 00:33:05,109 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-01-26 00:33:05,241 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-01-26 00:33:05,292 INFO  L103   denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 00:33:05,292 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000
[2024-01-26 00:33:05,292 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:05,301 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 00:33:05,309 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 00:33:05,335 INFO  L166   artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations.
[2024-01-26 00:33:05,341 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ========
[2024-01-26 00:33:05,345 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;@62a35533, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-01-26 00:33:05,345 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
Found a loop, use abstraction hammer
[2024-01-26 00:33:05,406 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 00:33:05,409 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 00:33:05,409 INFO  L85        PathProgramCache]: Analyzing trace with hash -1138441591, now seen corresponding path program 1 times
[2024-01-26 00:33:05,415 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 00:33:05,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158595559]
[2024-01-26 00:33:05,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:05,416 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 00:33:05,520 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:05,692 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 00:33:05,692 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 00:33:05,693 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158595559]
[2024-01-26 00:33:05,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158595559] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 00:33:05,694 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-01-26 00:33:05,695 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-01-26 00:33:05,695 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490603852]
[2024-01-26 00:33:05,696 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 00:33:05,700 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-01-26 00:33:05,700 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 00:33:05,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-01-26 00:33:05,737 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-01-26 00:33:05,737 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:05,739 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 00:33:05,740 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 2 states have (on average 131.0) internal successors, (262), 2 states have internal predecessors, (262), 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 00:33:05,740 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
[2024-01-26 00:33:06,212 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:06,213 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-01-26 00:33:06,213 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 00:33:06,214 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 00:33:06,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -2007933666, now seen corresponding path program 1 times
[2024-01-26 00:33:06,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 00:33:06,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375934690]
[2024-01-26 00:33:06,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:06,215 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 00:33:06,268 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:06,638 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 00:33:06,639 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 00:33:06,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375934690]
[2024-01-26 00:33:06,639 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375934690] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 00:33:06,639 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203812004]
[2024-01-26 00:33:06,639 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:06,639 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 00:33:06,640 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:06,686 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 00:33:06,704 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 00:33:06,850 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:06,853 INFO  L262         TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-01-26 00:33:06,863 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 00:33:06,995 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 00:33:06,996 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 00:33:07,070 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 00:33:07,070 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1203812004] provided 0 perfect and 2 imperfect interpolant sequences
[2024-01-26 00:33:07,070 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-01-26 00:33:07,071 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15
[2024-01-26 00:33:07,071 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330385677]
[2024-01-26 00:33:07,071 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-01-26 00:33:07,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-01-26 00:33:07,073 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 00:33:07,074 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-01-26 00:33:07,074 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210
[2024-01-26 00:33:07,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:07,075 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 00:33:07,075 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 19.533333333333335) internal successors, (293), 15 states have internal predecessors, (293), 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 00:33:07,076 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:07,076 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 00:33:07,628 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:07,629 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:07,651 INFO  L552       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-01-26 00:33:07,834 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 00:33:07,835 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 00:33:07,835 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 00:33:07,836 INFO  L85        PathProgramCache]: Analyzing trace with hash -1691747392, now seen corresponding path program 1 times
[2024-01-26 00:33:07,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 00:33:07,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789107476]
[2024-01-26 00:33:07,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:07,836 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 00:33:07,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:08,200 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-01-26 00:33:08,201 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 00:33:08,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789107476]
[2024-01-26 00:33:08,201 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789107476] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 00:33:08,201 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168629492]
[2024-01-26 00:33:08,201 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:08,201 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 00:33:08,201 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:08,202 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 00:33:08,204 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 00:33:08,337 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:08,339 INFO  L262         TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 12 conjunts are in the unsatisfiable core
[2024-01-26 00:33:08,344 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 00:33:08,566 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-01-26 00:33:08,566 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-01-26 00:33:08,687 INFO  L134       CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked.
[2024-01-26 00:33:08,687 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [168629492] provided 0 perfect and 2 imperfect interpolant sequences
[2024-01-26 00:33:08,688 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-01-26 00:33:08,688 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 24
[2024-01-26 00:33:08,688 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862050439]
[2024-01-26 00:33:08,688 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-01-26 00:33:08,689 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-01-26 00:33:08,689 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 00:33:08,690 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-01-26 00:33:08,690 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=421, Unknown=0, NotChecked=0, Total=552
[2024-01-26 00:33:08,690 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:08,690 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 00:33:08,691 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 13.375) internal successors, (321), 24 states have internal predecessors, (321), 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 00:33:08,691 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:08,691 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:08,691 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
[2024-01-26 00:33:09,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:09,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:09,313 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-01-26 00:33:09,335 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 00:33:09,520 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 00:33:09,520 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 00:33:09,524 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 00:33:09,524 INFO  L85        PathProgramCache]: Analyzing trace with hash 981210816, now seen corresponding path program 2 times
[2024-01-26 00:33:09,524 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 00:33:09,529 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939315884]
[2024-01-26 00:33:09,529 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:09,529 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 00:33:09,568 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:09,900 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 86 proven. 25 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-01-26 00:33:09,900 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 00:33:09,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939315884]
[2024-01-26 00:33:09,900 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939315884] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 00:33:09,900 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897647199]
[2024-01-26 00:33:09,901 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-01-26 00:33:09,901 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 00:33:09,901 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:09,902 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 00:33:09,961 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 00:33:10,090 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2024-01-26 00:33:10,090 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-01-26 00:33:10,092 INFO  L262         TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-01-26 00:33:10,096 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 00:33:10,185 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked.
[2024-01-26 00:33:10,185 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-01-26 00:33:10,186 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897647199] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 00:33:10,186 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-01-26 00:33:10,186 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [15] total 19
[2024-01-26 00:33:10,186 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214520634]
[2024-01-26 00:33:10,186 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 00:33:10,186 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-01-26 00:33:10,187 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 00:33:10,187 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-01-26 00:33:10,187 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342
[2024-01-26 00:33:10,187 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:10,187 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 00:33:10,188 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 43.833333333333336) internal successors, (263), 6 states have internal predecessors, (263), 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 00:33:10,188 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:10,188 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:10,188 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. 
[2024-01-26 00:33:10,188 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
[2024-01-26 00:33:10,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:10,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:10,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-01-26 00:33:10,359 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-01-26 00:33:10,378 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 00:33:10,565 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 00:33:10,565 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-01-26 00:33:10,566 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-01-26 00:33:10,566 INFO  L85        PathProgramCache]: Analyzing trace with hash 1583607081, now seen corresponding path program 1 times
[2024-01-26 00:33:10,566 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-01-26 00:33:10,566 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549160578]
[2024-01-26 00:33:10,566 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:10,566 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-01-26 00:33:10,602 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:10,915 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 86 proven. 25 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-01-26 00:33:10,916 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-01-26 00:33:10,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549160578]
[2024-01-26 00:33:10,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549160578] provided 0 perfect and 1 imperfect interpolant sequences
[2024-01-26 00:33:10,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223175640]
[2024-01-26 00:33:10,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-01-26 00:33:10,916 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-01-26 00:33:10,916 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3
[2024-01-26 00:33:10,941 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 00:33:10,942 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 00:33:11,078 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-01-26 00:33:11,081 INFO  L262         TraceCheckSpWp]: Trace formula consists of 571 conjuncts, 14 conjunts are in the unsatisfiable core
[2024-01-26 00:33:11,084 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-01-26 00:33:11,341 INFO  L134       CoverageAnalysis]: Checked inductivity of 186 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked.
[2024-01-26 00:33:11,341 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-01-26 00:33:11,344 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223175640] provided 1 perfect and 0 imperfect interpolant sequences
[2024-01-26 00:33:11,344 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-01-26 00:33:11,344 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [15] total 26
[2024-01-26 00:33:11,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638062433]
[2024-01-26 00:33:11,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-01-26 00:33:11,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-01-26 00:33:11,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-01-26 00:33:11,346 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-01-26 00:33:11,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650
[2024-01-26 00:33:11,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:11,346 INFO  L495      AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states
[2024-01-26 00:33:11,347 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 18.4) internal successors, (276), 15 states have internal predecessors, (276), 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 00:33:11,347 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. 
[2024-01-26 00:33:11,347 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. 
[2024-01-26 00:33:11,347 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 18 states. 
[2024-01-26 00:33:11,347 INFO  L154   InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. 
[2024-01-26 00:33:11,347 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
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Found a loop, use abstraction hammer
Received shutdown request...
[2024-01-26 00:47:43,878 WARN  L340       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2024-01-26 00:47:43,879 WARN  L340       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2024-01-26 00:47:43,879 WARN  L340       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end
[2024-01-26 00:47:44,273 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 00:47:44,470 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 00:47:44,471 WARN  L619      AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction.
[2024-01-26 00:47:44,473 INFO  L805   garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-01-26 00:47:44,503 INFO  L445         BasicCegarLoop]: Path program histogram: [2, 1, 1, 1]
[2024-01-26 00:47:44,504 INFO  L308   ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3)
[2024-01-26 00:47:44,506 INFO  L229   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2024-01-26 00:47:44,506 INFO  L179   ceAbstractionStarter]: Computing trace abstraction results
[2024-01-26 00:47:44,508 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.01 12:47:44 BasicIcfg
[2024-01-26 00:47:44,508 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-01-26 00:47:44,508 INFO  L158              Benchmark]: Toolchain (without parser) took 880388.42ms. Allocated memory was 270.5MB in the beginning and 456.1MB in the end (delta: 185.6MB). Free memory was 219.3MB in the beginning and 334.9MB in the end (delta: -115.6MB). Peak memory consumption was 307.5MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,508 INFO  L158              Benchmark]: CDTParser took 0.11ms. Allocated memory is still 210.8MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB.
[2024-01-26 00:47:44,508 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 222.55ms. Allocated memory is still 270.5MB. Free memory was 218.8MB in the beginning and 205.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,509 INFO  L158              Benchmark]: Boogie Procedure Inliner took 48.20ms. Allocated memory is still 270.5MB. Free memory was 205.2MB in the beginning and 201.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,509 INFO  L158              Benchmark]: Boogie Preprocessor took 55.38ms. Allocated memory is still 270.5MB. Free memory was 201.5MB in the beginning and 198.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,509 INFO  L158              Benchmark]: RCFGBuilder took 618.52ms. Allocated memory is still 270.5MB. Free memory was 198.9MB in the beginning and 163.7MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,509 INFO  L158              Benchmark]: TraceAbstraction took 879419.07ms. Allocated memory was 270.5MB in the beginning and 456.1MB in the end (delta: 185.6MB). Free memory was 234.0MB in the beginning and 334.9MB in the end (delta: -100.8MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB.
[2024-01-26 00:47:44,510 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 210.8MB. Free memory is still 157.8MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 222.55ms. Allocated memory is still 270.5MB. Free memory was 218.8MB in the beginning and 205.2MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 48.20ms. Allocated memory is still 270.5MB. Free memory was 205.2MB in the beginning and 201.5MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * Boogie Preprocessor took 55.38ms. Allocated memory is still 270.5MB. Free memory was 201.5MB in the beginning and 198.9MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB.
 * RCFGBuilder took 618.52ms. Allocated memory is still 270.5MB. Free memory was 198.9MB in the beginning and 163.7MB in the end (delta: 35.1MB). Peak memory consumption was 34.6MB. Max. memory is 8.0GB.
 * TraceAbstraction took 879419.07ms. Allocated memory was 270.5MB in the beginning and 456.1MB in the end (delta: 185.6MB). Free memory was 234.0MB in the beginning and 334.9MB in the end (delta: -100.8MB). Peak memory consumption was 321.2MB. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Independence relation #1 benchmarks
    ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 18734, independent: 17512, independent conditional: 17512, independent unconditional: 0, dependent: 1222, dependent conditional: 1222, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 17512, independent: 17512, independent conditional: 17512, 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: 17512, independent: 17512, independent conditional: 17512, 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: 17512, independent: 17512, independent conditional: 0, independent unconditional: 17512, 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: 17512, independent: 17512, independent conditional: 0, independent unconditional: 17512, 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: 17512, independent: 17512, independent conditional: 0, independent unconditional: 17512, 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: 17512, independent: 17512, independent conditional: 0, independent unconditional: 17512, 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: 17512, independent: 17512, independent conditional: 0, independent unconditional: 17512, 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: 17512, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 17512, unknown conditional: 0, unknown unconditional: 17512] , Statistics on independence cache: Total cache size (in pairs): 17512, Positive cache size: 17512, Positive conditional cache size: 0, Positive unconditional cache size: 17512, 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: 1222
  - StatisticsResult: Proof manager benchmarks
    IrresponsibleProofs: 8, RedundantProofs: 3, ProvenStates: 874, Times there's more than one choice: 822, Avg number of choices: 4.448512585812357
  - StatisticsResult: Reduction benchmarks
    0.0s Time before loop, 0.2s Time in loop, 0.2s Time in total, Has Loop: true, Protected Variables: [write~init~int_#value, ~result_11~0, old(~result_11~0), thread2Thread1of1ForFork0_minus_#in~a#1, thread2Thread1of1ForFork0_minus_#in~b#1, ~ends_with_2~0.offset, old(~ends_with_2~0.offset), thread1Thread1of1ForFork1_#t~short10#1, thread1Thread1of1ForFork1_#t~short12#1, thread1Thread1of1ForFork1_#t~short14#1, thread1Thread1of1ForFork1_#t~short16#1, thread1Thread1of1ForFork1_#t~mem11#1, thread1Thread1of1ForFork1_#t~mem13#1, thread1Thread1of1ForFork1_#t~mem15#1, thread1Thread1of1ForFork1_#t~short5#1, thread1Thread1of1ForFork1_#t~short8#1, thread2Thread1of1ForFork0_thidvar0, old(thread2Thread1of1ForFork0_thidvar0), thread2Thread1of1ForFork0_thidvar1, old(thread2Thread1of1ForFork0_thidvar1), thread2Thread1of1ForFork0_thidvar2, old(thread2Thread1of1ForFork0_thidvar2), write~int_#ptr.base, #Ultimate.allocOnHeap_#res.offset, thread1_#t~ite19#1, thread1_#res#1.base, thread2_#res#1.base, thread1_#t~ite21#1, thread1_#t~ite22#1, thread2Thread1of1ForFork0_~_argptr#1.base, thread1_#t~mem3#1, thread1_#t~mem4#1, thread1_#t~mem6#1, thread1_#t~mem7#1, thread1_#t~mem9#1, thread2_#t~ite41#1, thread2_#t~ite43#1, thread2_#t~ite44#1, ULTIMATE.start_main_#res#1, ~ends_with_2~0.base, old(~ends_with_2~0.base), ULTIMATE.start_create_fresh_bool_array_~arr~0#1.base, ULTIMATE.start_main_#t~mem63#1, ULTIMATE.start_main_#t~mem64#1, thread2Thread1of1ForFork0_#res#1.offset, thread1_minus_#in~a#1, thread2_minus_#in~a#1, thread1_minus_#in~b#1, thread2_minus_#in~b#1, thread1Thread1of1ForFork1_#t~ite19#1, thread1Thread1of1ForFork1_#res#1.base, thread1_~_argptr#1.base, thread2_~_argptr#1.base, thread1Thread1of1ForFork1_#t~ite21#1, thread1Thread1of1ForFork1_#t~ite22#1, thread1Thread1of1ForFork1_#t~mem3#1, thread1Thread1of1ForFork1_#t~mem4#1, read~int_#ptr.base, thread1Thread1of1ForFork1_#t~mem6#1, thread1Thread1of1ForFork1_#t~mem7#1, thread1Thread1of1ForFork1_#t~mem9#1, ~result_8~0, old(~result_8~0), ULTIMATE.start_create_fresh_bool_array_#res#1.base, thread2Thread1of1ForFork0_#t~nondet23#1, thread2Thread1of1ForFork0_#t~nondet24#1, thread2Thread1of1ForFork0_#t~ret40#1, thread2Thread1of1ForFork0_#t~ret42#1, ULTIMATE.start_#t~ret68#1, thread1_#res#1.offset, thread2_#res#1.offset, thread1Thread1of1ForFork1_minus_#in~a#1, thread1Thread1of1ForFork1_minus_#in~b#1, ULTIMATE.start_create_fresh_bool_array_#res#1.offset, thread1Thread1of1ForFork1_~_argptr#1.base, ULTIMATE.start_main_~#t2~0#1.offset, ~i_9~0, old(~i_9~0), thread2_#t~nondet23#1, thread2_#t~nondet24#1, thread1_#t~ret18#1, #Ultimate.allocOnStack_~size, thread1_#t~ret20#1, thread2_#t~ret40#1, thread2_#t~ret42#1, thread1Thread1of1ForFork1_#res#1.offset, read~int_#sizeOfReadType, ULTIMATE.start_create_fresh_bool_array_#t~nondet67#1, ULTIMATE.start_create_fresh_bool_array_~i~0#1, write~init~int_#sizeOfWrittenType, thread2Thread1of1ForFork0_minus_~a#1, thread2Thread1of1ForFork0_minus_~b#1, thread2Thread1of1ForFork0_~_argptr#1.offset, ~filename_0~0, old(~filename_0~0), ~filename_4~0, old(~filename_4~0), ~ends_with_6~0.offset, old(~ends_with_6~0.offset), ULTIMATE.start_create_fresh_bool_array_~size#1, ULTIMATE.start_create_fresh_bool_array_~arr~0#1.offset, thread1Thread1of1ForFork1_#t~ret18#1, ULTIMATE.start_main_~#t1~0#1.offset, thread1Thread1of1ForFork1_#t~ret20#1, ~ends_with_6~0.base, old(~ends_with_6~0.base), #Ultimate.allocOnStack_#res.offset, thread2Thread1of1ForFork0_#in~_argptr#1.offset, ULTIMATE.dealloc_~addr.offset, thread1_minus_~a#1, thread2_minus_~a#1, thread1_minus_~b#1, thread2_minus_~b#1, thread1_~_argptr#1.offset, thread2_~_argptr#1.offset, write~int_#value, ULTIMATE.start_main_#t~pre59#1, write~init~int_#ptr.offset, ULTIMATE.start_main_#t~pre61#1, 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), thread2Thread1of1ForFork0_assume_abort_if_not_~cond#1, ULTIMATE.start_create_fresh_bool_array_#t~malloc65#1.base, thread1_#in~_argptr#1.offset, thread2_#in~_argptr#1.offset, thread1Thread1of1ForFork1_minus_~a#1, thread1Thread1of1ForFork1_minus_~b#1, thread1Thread1of1ForFork1_~_argptr#1.offset, #Ultimate.allocOnHeap_#res.base, thread2Thread1of1ForFork0_#in~_argptr#1.base, #valid, old(#valid), read~int_#value, #Ultimate.allocInit_~size, thread1_assume_abort_if_not_~cond#1, thread2_assume_abort_if_not_~cond#1, write~init~int_#ptr.base, thread1Thread1of1ForFork1_#in~_argptr#1.offset, thread2Thread1of1ForFork0_#t~post39#1, thread1_#in~_argptr#1.base, thread2_#in~_argptr#1.base, thread2Thread1of1ForFork0_minus_#res#1, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~break_10~0, old(~break_10~0), ~break_13~0, old(~break_13~0), thread2Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, #Ultimate.allocInit_ptrBase, ULTIMATE.start_main_#t~ret58#1.base, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread1_#t~post17#1, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_#t~nondet45#1, ULTIMATE.start_main_#t~nondet46#1, ULTIMATE.start_main_#t~nondet47#1, ULTIMATE.start_main_#t~nondet48#1, ULTIMATE.start_main_#t~nondet49#1, #length, old(#length), thread2_#t~post39#1, ULTIMATE.start_main_#t~nondet50#1, ULTIMATE.start_main_#t~nondet51#1, ULTIMATE.start_main_#t~nondet52#1, ULTIMATE.start_main_#t~nondet53#1, ULTIMATE.start_main_#t~nondet54#1, ULTIMATE.start_main_#t~nondet55#1, ULTIMATE.start_main_#t~nondet56#1, ULTIMATE.start_main_#t~nondet60#1, ULTIMATE.start_main_#t~nondet62#1, thread1Thread1of1ForFork1_#in~_argptr#1.base, ULTIMATE.start_main_#t~ret57#1.base, ULTIMATE.start_main_~#t2~0#1.base, write~int_#sizeOfWrittenType, thread1_minus_#res#1, thread2_minus_#res#1, #StackHeapBarrier, old(#StackHeapBarrier), thread1_#t~nondet1#1, thread1_#t~nondet2#1, thread1_assume_abort_if_not_#in~cond#1, thread2_assume_abort_if_not_#in~cond#1, ULTIMATE.start_main_#t~ret57#1.offset, thread1Thread1of1ForFork1_#t~post17#1, ULTIMATE.start_main_#t~ret58#1.offset, thread2Thread1of1ForFork0_#t~short27#1, thread2Thread1of1ForFork0_#t~mem25#1, thread2Thread1of1ForFork0_#t~mem26#1, ~is_null_1~0, old(~is_null_1~0), ~is_null_5~0, old(~is_null_5~0), thread2Thread1of1ForFork0_#t~mem28#1, thread2Thread1of1ForFork0_#t~mem29#1, thread2Thread1of1ForFork0_#t~short30#1, thread2Thread1of1ForFork0_#t~short32#1, thread2Thread1of1ForFork0_#t~short34#1, thread2Thread1of1ForFork0_#t~short36#1, thread2Thread1of1ForFork0_#t~short38#1, ULTIMATE.start_create_fresh_bool_array_#t~malloc65#1.offset, thread2Thread1of1ForFork0_#t~mem31#1, thread2Thread1of1ForFork0_#t~mem33#1, thread2Thread1of1ForFork0_#t~mem35#1, thread2Thread1of1ForFork0_#t~mem37#1, thread1Thread1of1ForFork1_minus_#res#1, ULTIMATE.start_create_fresh_bool_array_#t~post66#1, write~int_#ptr.offset, ULTIMATE.start_create_fresh_bool_array_#in~size#1, #Ultimate.allocOnHeap_~size, thread1Thread1of1ForFork1_#t~nondet1#1, thread1Thread1of1ForFork1_#t~nondet2#1, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #memory_int, old(#memory_int), thread1_#t~short10#1, thread1_#t~short12#1, thread1_#t~short14#1, thread1_#t~short16#1, ~get_subject_3~0, old(~get_subject_3~0), ~get_subject_7~0, old(~get_subject_7~0), thread1_#t~mem11#1, #Ultimate.allocOnStack_#res.base, thread1_#t~mem13#1, thread1_#t~mem15#1, thread2_#t~short27#1, thread1_#t~short5#1, thread1_#t~short8#1, thread2_#t~mem25#1, thread2_#t~mem26#1, thread2_#t~mem28#1, thread2_#t~mem29#1, thread2_#t~short30#1, thread2_#t~short32#1, thread2_#t~short34#1, thread2_#t~short36#1, thread2_#t~short38#1, thread2_#t~mem31#1, thread2_#t~mem33#1, thread2_#t~mem35#1, thread2_#t~mem37#1, thread2Thread1of1ForFork0_#res#1.base, thread2Thread1of1ForFork0_#t~ite41#1, thread2Thread1of1ForFork0_#t~ite43#1, thread2Thread1of1ForFork0_#t~ite44#1, ~i_12~0, old(~i_12~0), read~int_#ptr.offset], Protected Variables before encountering a loop: []
  - TimeoutResultAtElement [Line: 128]: Timeout (TraceAbstraction)
    Unable to prove that a call to reach_error is unreachable Cancelled while executing DynamicStratifiedReduction.
  - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION with 1 thread instances
    CFG has 5 procedures, 798 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 879.2s, OverallIterations: 5, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 874.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 59, 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.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2553 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 3173 ConstructedInterpolants, 0 QuantifiedInterpolants, 4655 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2089 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 766/957 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate could not prove your program: Timeout
Completed graceful shutdown