/root/.sdkman/candidates/java/current/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --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/popl20-simple-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.dynamic-abstractions-a4a1cd3-m [2024-05-30 16:55:28,311 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-05-30 16:55:28,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/settings/gemcutter/DynamicStratifiedAbstractions.epf [2024-05-30 16:55:28,379 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-05-30 16:55:28,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-05-30 16:55:28,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2024-05-30 16:55:28,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-05-30 16:55:28,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-05-30 16:55:28,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-05-30 16:55:28,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-05-30 16:55:28,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-05-30 16:55:28,403 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-05-30 16:55:28,403 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-05-30 16:55:28,403 INFO L153 SettingsManager]: * Use SBE=true [2024-05-30 16:55:28,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-05-30 16:55:28,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-05-30 16:55:28,404 INFO L153 SettingsManager]: * sizeof long=4 [2024-05-30 16:55:28,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-05-30 16:55:28,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-05-30 16:55:28,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-05-30 16:55:28,408 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-05-30 16:55:28,409 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-05-30 16:55:28,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-05-30 16:55:28,410 INFO L153 SettingsManager]: * sizeof long double=12 [2024-05-30 16:55:28,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-05-30 16:55:28,410 INFO L153 SettingsManager]: * Use constant arrays=true [2024-05-30 16:55:28,410 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-05-30 16:55:28,411 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-05-30 16:55:28,411 INFO L153 SettingsManager]: * To the following directory=./dump/ [2024-05-30 16:55:28,411 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-05-30 16:55:28,412 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:55:28,412 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Abstraction for dynamic stratified reduction=VARIABLES_GLOBAL [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=DYNAMIC_ABSTRACTIONS [2024-05-30 16:55:28,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2024-05-30 16:55:28,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-05-30 16:55:28,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2024-05-30 16:55:28,414 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-05-30 16:55:28,414 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-05-30 16:55:28,633 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-05-30 16:55:28,657 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-05-30 16:55:28,659 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-05-30 16:55:28,660 INFO L270 PluginConnector]: Initializing CDTParser... [2024-05-30 16:55:28,660 INFO L274 PluginConnector]: CDTParser initialized [2024-05-30 16:55:28,662 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2024-05-30 16:55:29,848 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-05-30 16:55:30,054 INFO L384 CDTParser]: Found 1 translation units. [2024-05-30 16:55:30,054 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-simple-queue.wvr.c [2024-05-30 16:55:30,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9d32ed48/3f96c81830f047678f05c6068882b6a0/FLAG2c79ab5bf [2024-05-30 16:55:30,072 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/b9d32ed48/3f96c81830f047678f05c6068882b6a0 [2024-05-30 16:55:30,074 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-05-30 16:55:30,076 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-05-30 16:55:30,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-05-30 16:55:30,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-05-30 16:55:30,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-05-30 16:55:30,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62ed4f85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30, skipping insertion in model container [2024-05-30 16:55:30,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,110 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-05-30 16:55:30,247 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/popl20-simple-queue.wvr.c[2438,2451] [2024-05-30 16:55:30,255 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:55:30,263 INFO L202 MainTranslator]: Completed pre-run [2024-05-30 16:55:30,279 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/popl20-simple-queue.wvr.c[2438,2451] [2024-05-30 16:55:30,283 INFO L209 PostProcessor]: Analyzing one entry point: main [2024-05-30 16:55:30,295 INFO L206 MainTranslator]: Completed translation [2024-05-30 16:55:30,296 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30 WrapperNode [2024-05-30 16:55:30,296 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-05-30 16:55:30,297 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-05-30 16:55:30,297 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-05-30 16:55:30,297 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-05-30 16:55:30,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,311 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,334 INFO L138 Inliner]: procedures = 24, calls = 33, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 133 [2024-05-30 16:55:30,335 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-05-30 16:55:30,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-05-30 16:55:30,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-05-30 16:55:30,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-05-30 16:55:30,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,353 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,356 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,358 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,359 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-05-30 16:55:30,362 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-05-30 16:55:30,362 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-05-30 16:55:30,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-05-30 16:55:30,363 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (1/1) ... [2024-05-30 16:55:30,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-05-30 16:55:30,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:30,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-05-30 16:55:30,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-05-30 16:55:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-05-30 16:55:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-05-30 16:55:30,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-05-30 16:55:30,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-05-30 16:55:30,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-05-30 16:55:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-05-30 16:55:30,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-05-30 16:55:30,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-05-30 16:55:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-05-30 16:55:30,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-05-30 16:55:30,459 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-05-30 16:55:30,594 INFO L241 CfgBuilder]: Building ICFG [2024-05-30 16:55:30,595 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2024-05-30 16:55:30,823 INFO L282 CfgBuilder]: Performing block encoding [2024-05-30 16:55:30,901 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-05-30 16:55:30,901 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2024-05-30 16:55:30,902 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:55:30 BoogieIcfgContainer [2024-05-30 16:55:30,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-05-30 16:55:30,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-05-30 16:55:30,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-05-30 16:55:30,907 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-05-30 16:55:30,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.05 04:55:30" (1/3) ... [2024-05-30 16:55:30,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7ce86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:55:30, skipping insertion in model container [2024-05-30 16:55:30,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.05 04:55:30" (2/3) ... [2024-05-30 16:55:30,908 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7ce86e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.05 04:55:30, skipping insertion in model container [2024-05-30 16:55:30,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.05 04:55:30" (3/3) ... [2024-05-30 16:55:30,909 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-simple-queue.wvr.c [2024-05-30 16:55:30,917 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2024-05-30 16:55:30,926 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-05-30 16:55:30,926 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-05-30 16:55:30,927 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-05-30 16:55:30,981 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-05-30 16:55:31,017 INFO L103 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:55:31,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2024-05-30 16:55:31,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:31,020 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2024-05-30 16:55:31,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2024-05-30 16:55:31,094 INFO L166 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2024-05-30 16:55:31,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION ======== [2024-05-30 16:55:31,108 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;@454cb35b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-05-30 16:55:31,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-05-30 16:55:31,115 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:31,173 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 140 states. [2024-05-30 16:55:31,173 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:31,176 INFO L78 Accepts]: Start accepts. Automaton has currently 141 states, but on-demand construction may add more states Word has length 91 [2024-05-30 16:55:31,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:31,179 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:31,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:31,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1388801947, now seen corresponding path program 1 times [2024-05-30 16:55:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:31,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561472745] [2024-05-30 16:55:31,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:31,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:31,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:31,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:31,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561472745] [2024-05-30 16:55:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561472745] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-05-30 16:55:31,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499459058] [2024-05-30 16:55:31,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:31,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-05-30 16:55:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:31,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-05-30 16:55:31,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-05-30 16:55:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,485 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:31,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.5) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:31,486 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,486 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:31,521 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 146 states. [2024-05-30 16:55:31,521 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:31,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,523 INFO L78 Accepts]: Start accepts. Automaton has currently 147 states, but on-demand construction may add more states Word has length 88 [2024-05-30 16:55:31,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:31,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-05-30 16:55:31,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:31,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:31,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1740650221, now seen corresponding path program 1 times [2024-05-30 16:55:31,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:31,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829182069] [2024-05-30 16:55:31,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:31,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:31,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:31,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:31,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:31,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829182069] [2024-05-30 16:55:31,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829182069] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:31,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:31,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-05-30 16:55:31,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975743922] [2024-05-30 16:55:31,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:31,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-05-30 16:55:31,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:31,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-05-30 16:55:31,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-05-30 16:55:31,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,843 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:31,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:31,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,843 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,844 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:31,966 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 161 states. [2024-05-30 16:55:31,967 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:31,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:31,968 INFO L78 Accepts]: Start accepts. Automaton has currently 162 states, but on-demand construction may add more states Word has length 92 [2024-05-30 16:55:31,971 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:31,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-05-30 16:55:31,972 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:31,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:31,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1644723608, now seen corresponding path program 1 times [2024-05-30 16:55:31,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:31,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529600562] [2024-05-30 16:55:31,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:31,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:32,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:32,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:32,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529600562] [2024-05-30 16:55:32,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529600562] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:32,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:32,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-05-30 16:55:32,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447453256] [2024-05-30 16:55:32,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:32,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-05-30 16:55:32,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:32,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-05-30 16:55:32,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-05-30 16:55:32,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,212 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:32,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:32,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:32,212 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,212 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:32,351 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 241 states. [2024-05-30 16:55:32,351 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:32,352 INFO L78 Accepts]: Start accepts. Automaton has currently 242 states, but on-demand construction may add more states Word has length 96 [2024-05-30 16:55:32,353 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:32,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-05-30 16:55:32,353 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:32,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:32,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1302511965, now seen corresponding path program 1 times [2024-05-30 16:55:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807667832] [2024-05-30 16:55:32,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:32,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:55:32,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:32,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807667832] [2024-05-30 16:55:32,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807667832] provided 1 perfect and 0 imperfect interpolant sequences [2024-05-30 16:55:32,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-05-30 16:55:32,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-05-30 16:55:32,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332133119] [2024-05-30 16:55:32,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-05-30 16:55:32,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-05-30 16:55:32,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-05-30 16:55:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-05-30 16:55:32,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,552 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:32,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:32,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:32,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:32,553 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,554 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:32,717 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 249 states. [2024-05-30 16:55:32,718 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:32,719 INFO L78 Accepts]: Start accepts. Automaton has currently 250 states, but on-demand construction may add more states Word has length 104 [2024-05-30 16:55:32,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:32,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-05-30 16:55:32,721 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:32,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash -391841281, now seen corresponding path program 1 times [2024-05-30 16:55:32,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:32,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40824582] [2024-05-30 16:55:32,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:32,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:32,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:33,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:33,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40824582] [2024-05-30 16:55:33,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40824582] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:33,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436617076] [2024-05-30 16:55:33,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:33,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:33,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:33,642 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-05-30 16:55:33,657 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-05-30 16:55:33,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:33,757 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2024-05-30 16:55:33,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:34,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:34,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:34,557 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:55:34,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-30 16:55:35,379 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:35,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436617076] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:35,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:35,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 12] total 30 [2024-05-30 16:55:35,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462121059] [2024-05-30 16:55:35,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:35,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-05-30 16:55:35,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:35,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-05-30 16:55:35,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2024-05-30 16:55:35,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:35,383 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:35,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 7.3) internal successors, (219), 30 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:35,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:35,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:35,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:35,383 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:35,384 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:35,384 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:36,500 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 273 states. [2024-05-30 16:55:36,501 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:36,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:36,501 INFO L78 Accepts]: Start accepts. Automaton has currently 274 states, but on-demand construction may add more states Word has length 116 [2024-05-30 16:55:36,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:36,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-05-30 16:55:36,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:36,703 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:36,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1772858918, now seen corresponding path program 2 times [2024-05-30 16:55:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353234763] [2024-05-30 16:55:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:55:36,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:36,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353234763] [2024-05-30 16:55:36,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353234763] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:36,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379258662] [2024-05-30 16:55:36,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:55:36,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:36,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:36,814 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-05-30 16:55:36,836 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-05-30 16:55:36,906 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:55:36,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:36,908 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2024-05-30 16:55:36,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:37,004 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:55:37,005 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:37,242 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-05-30 16:55:37,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379258662] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:37,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:37,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 5] total 7 [2024-05-30 16:55:37,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664865153] [2024-05-30 16:55:37,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:37,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-05-30 16:55:37,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:37,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-05-30 16:55:37,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-05-30 16:55:37,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:37,246 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:37,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.428571428571427) internal successors, (178), 7 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:37,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:37,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:37,246 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:37,247 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:37,249 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:37,380 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 414 states. [2024-05-30 16:55:37,383 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:37,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:37,384 INFO L78 Accepts]: Start accepts. Automaton has currently 415 states, but on-demand construction may add more states Word has length 120 [2024-05-30 16:55:37,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:37,394 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-05-30 16:55:37,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:37,608 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:37,608 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:37,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1002693909, now seen corresponding path program 3 times [2024-05-30 16:55:37,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:37,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656887262] [2024-05-30 16:55:37,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:37,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:38,869 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:38,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656887262] [2024-05-30 16:55:38,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656887262] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:38,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668754527] [2024-05-30 16:55:38,870 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:55:38,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:38,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:38,872 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-05-30 16:55:38,883 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-05-30 16:55:39,167 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-05-30 16:55:39,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:39,169 INFO L262 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 21 conjunts are in the unsatisfiable core [2024-05-30 16:55:39,172 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 16:55:39,760 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:40,049 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:55:40,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-30 16:55:40,409 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-05-30 16:55:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668754527] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:40,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 15, 15] total 41 [2024-05-30 16:55:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031806218] [2024-05-30 16:55:40,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:40,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-05-30 16:55:40,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:40,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-05-30 16:55:40,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1493, Unknown=0, NotChecked=0, Total=1640 [2024-05-30 16:55:40,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:40,413 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:40,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.170731707317073) internal successors, (253), 41 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:40,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:40,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:40,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:40,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:40,414 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:40,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:40,415 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:40,415 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:42,013 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 423 states. [2024-05-30 16:55:42,013 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:42,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:42,014 INFO L78 Accepts]: Start accepts. Automaton has currently 424 states, but on-demand construction may add more states Word has length 128 [2024-05-30 16:55:42,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:42,022 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-05-30 16:55:42,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:42,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:42,222 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:42,222 INFO L85 PathProgramCache]: Analyzing trace with hash 816254349, now seen corresponding path program 4 times [2024-05-30 16:55:42,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:42,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15713517] [2024-05-30 16:55:42,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:42,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:43,642 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:43,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15713517] [2024-05-30 16:55:43,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15713517] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:43,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96723954] [2024-05-30 16:55:43,643 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:55:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:43,645 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-05-30 16:55:43,653 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-05-30 16:55:43,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:55:43,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:43,743 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 37 conjunts are in the unsatisfiable core [2024-05-30 16:55:43,746 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:44,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:44,503 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:55:44,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:55:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96723954] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:45,667 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:45,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 19, 19] total 49 [2024-05-30 16:55:45,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300988692] [2024-05-30 16:55:45,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:45,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-05-30 16:55:45,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:45,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-05-30 16:55:45,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=450, Invalid=1902, Unknown=0, NotChecked=0, Total=2352 [2024-05-30 16:55:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:45,672 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:45,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 5.938775510204081) internal successors, (291), 49 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:45,672 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:45,673 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:45,673 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:47,465 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 447 states. [2024-05-30 16:55:47,465 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:47,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:47,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:47,467 INFO L78 Accepts]: Start accepts. Automaton has currently 448 states, but on-demand construction may add more states Word has length 140 [2024-05-30 16:55:47,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:47,483 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-05-30 16:55:47,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-05-30 16:55:47,678 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:47,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:47,679 INFO L85 PathProgramCache]: Analyzing trace with hash 475989172, now seen corresponding path program 5 times [2024-05-30 16:55:47,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:47,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655509621] [2024-05-30 16:55:47,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:47,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:55:47,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:47,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655509621] [2024-05-30 16:55:47,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655509621] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:47,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683199102] [2024-05-30 16:55:47,809 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:55:47,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:47,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:47,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:55:47,828 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-05-30 16:55:47,909 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-05-30 16:55:47,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:47,911 INFO L262 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 6 conjunts are in the unsatisfiable core [2024-05-30 16:55:47,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:48,034 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:55:48,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:55:48,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683199102] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:48,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:48,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 10 [2024-05-30 16:55:48,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746935360] [2024-05-30 16:55:48,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:48,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-05-30 16:55:48,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:48,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-05-30 16:55:48,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2024-05-30 16:55:48,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:48,407 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:48,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.4) internal successors, (194), 10 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:48,408 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:48,408 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:48,557 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 651 states. [2024-05-30 16:55:48,557 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:48,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:55:48,558 INFO L78 Accepts]: Start accepts. Automaton has currently 652 states, but on-demand construction may add more states Word has length 144 [2024-05-30 16:55:48,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:48,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-05-30 16:55:48,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:48,765 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:48,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1372756601, now seen corresponding path program 6 times [2024-05-30 16:55:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577579984] [2024-05-30 16:55:48,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:48,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:50,476 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 88 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:50,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577579984] [2024-05-30 16:55:50,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577579984] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:50,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509180139] [2024-05-30 16:55:50,476 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:55:50,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:50,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:50,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:55:50,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-05-30 16:55:50,792 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2024-05-30 16:55:50,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:50,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 36 conjunts are in the unsatisfiable core [2024-05-30 16:55:50,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:55:51,263 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:51,359 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:55:51,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:55:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2024-05-30 16:55:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509180139] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:51,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 18, 11] total 40 [2024-05-30 16:55:51,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255839443] [2024-05-30 16:55:51,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:51,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-05-30 16:55:51,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:51,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-05-30 16:55:51,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1434, Unknown=0, NotChecked=0, Total=1560 [2024-05-30 16:55:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:51,461 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:51,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 6.275) internal successors, (251), 40 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:51,461 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:51,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:51,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:51,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:55:51,462 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:51,462 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:53,338 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 675 states. [2024-05-30 16:55:53,338 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:53,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:55:53,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:55:53,339 INFO L78 Accepts]: Start accepts. Automaton has currently 676 states, but on-demand construction may add more states Word has length 156 [2024-05-30 16:55:53,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:53,346 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-05-30 16:55:53,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-05-30 16:55:53,546 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:53,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1029879712, now seen corresponding path program 7 times [2024-05-30 16:55:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:53,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777540748] [2024-05-30 16:55:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:53,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:53,743 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:55:53,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:53,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777540748] [2024-05-30 16:55:53,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777540748] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:53,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327732568] [2024-05-30 16:55:53,744 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:55:53,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:53,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:53,749 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:55:53,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-05-30 16:55:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:53,863 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjunts are in the unsatisfiable core [2024-05-30 16:55:53,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:53,987 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 32 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:55:53,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:55:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-05-30 16:55:54,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327732568] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:55:54,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:55:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 9] total 13 [2024-05-30 16:55:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854156580] [2024-05-30 16:55:54,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:55:54,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-05-30 16:55:54,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:55:54,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-05-30 16:55:54,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2024-05-30 16:55:54,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:54,367 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:55:54,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 16.153846153846153) internal successors, (210), 13 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:54,368 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:55:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:55:54,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:54,369 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:55:54,549 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 942 states. [2024-05-30 16:55:54,549 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:55:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:55:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:55:54,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:55:54,550 INFO L78 Accepts]: Start accepts. Automaton has currently 943 states, but on-demand construction may add more states Word has length 160 [2024-05-30 16:55:54,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:55:54,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-05-30 16:55:54,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:54,757 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:55:54,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:55:54,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1606948709, now seen corresponding path program 8 times [2024-05-30 16:55:54,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:55:54,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015888898] [2024-05-30 16:55:54,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:55:54,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:55:54,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:55:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:56,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:55:56,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015888898] [2024-05-30 16:55:56,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015888898] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:55:56,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10782546] [2024-05-30 16:55:56,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:55:56,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:55:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:55:56,654 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:55:56,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-05-30 16:55:56,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:55:56,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:55:56,766 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 66 conjunts are in the unsatisfiable core [2024-05-30 16:55:56,770 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:55:57,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-05-30 16:55:58,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 16:55:58,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-05-30 16:55:58,743 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 149 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:55:58,743 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:00,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-05-30 16:56:00,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 50 [2024-05-30 16:56:00,233 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:56:00,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 133 [2024-05-30 16:56:00,245 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-30 16:56:00,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 130 treesize of output 102 [2024-05-30 16:56:00,253 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-05-30 16:56:00,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 67 [2024-05-30 16:56:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10782546] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:01,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 36, 33] total 91 [2024-05-30 16:56:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554501092] [2024-05-30 16:56:01,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:01,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2024-05-30 16:56:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2024-05-30 16:56:01,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1192, Invalid=6949, Unknown=49, NotChecked=0, Total=8190 [2024-05-30 16:56:01,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:01,313 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:01,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 4.56043956043956) internal successors, (415), 91 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:01,314 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:01,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:01,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:01,315 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:01,315 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:06,778 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 966 states. [2024-05-30 16:56:06,778 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:06,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:06,779 INFO L78 Accepts]: Start accepts. Automaton has currently 967 states, but on-demand construction may add more states Word has length 172 [2024-05-30 16:56:06,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:06,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-05-30 16:56:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:06,981 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:06,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:06,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1010850444, now seen corresponding path program 9 times [2024-05-30 16:56:06,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:06,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674167355] [2024-05-30 16:56:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-30 16:56:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674167355] [2024-05-30 16:56:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674167355] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901720755] [2024-05-30 16:56:07,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:56:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:07,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:07,202 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:07,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-05-30 16:56:08,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-05-30 16:56:08,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:08,227 INFO L262 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 10 conjunts are in the unsatisfiable core [2024-05-30 16:56:08,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:08,396 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 50 proven. 32 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-30 16:56:08,396 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 34 proven. 48 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-05-30 16:56:08,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901720755] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:08,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:08,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 11] total 16 [2024-05-30 16:56:08,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470846257] [2024-05-30 16:56:08,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:08,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-05-30 16:56:08,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:08,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-05-30 16:56:08,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-05-30 16:56:08,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:08,918 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:08,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 14.125) internal successors, (226), 16 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:08,918 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:08,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:08,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:08,919 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:08,919 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:09,190 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1296 states. [2024-05-30 16:56:09,190 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:09,192 INFO L78 Accepts]: Start accepts. Automaton has currently 1297 states, but on-demand construction may add more states Word has length 176 [2024-05-30 16:56:09,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:09,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:09,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-05-30 16:56:09,399 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:09,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:09,400 INFO L85 PathProgramCache]: Analyzing trace with hash -644905903, now seen corresponding path program 10 times [2024-05-30 16:56:09,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:09,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377995944] [2024-05-30 16:56:09,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:09,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:09,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:11,517 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:11,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:11,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377995944] [2024-05-30 16:56:11,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377995944] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:11,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912907113] [2024-05-30 16:56:11,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:56:11,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:11,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:11,521 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:11,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-05-30 16:56:11,644 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:56:11,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:11,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 59 conjunts are in the unsatisfiable core [2024-05-30 16:56:11,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:13,040 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:13,326 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:56:13,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:56:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:15,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912907113] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:15,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 31, 31] total 85 [2024-05-30 16:56:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188789064] [2024-05-30 16:56:15,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:15,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2024-05-30 16:56:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2024-05-30 16:56:15,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=826, Invalid=6314, Unknown=0, NotChecked=0, Total=7140 [2024-05-30 16:56:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:15,248 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:15,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 85 states have (on average 5.117647058823529) internal successors, (435), 85 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:15,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:15,248 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:15,249 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:15,249 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:21,111 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1320 states. [2024-05-30 16:56:21,112 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:21,113 INFO L78 Accepts]: Start accepts. Automaton has currently 1321 states, but on-demand construction may add more states Word has length 188 [2024-05-30 16:56:21,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:21,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:21,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,12 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:21,316 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:21,316 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1006637704, now seen corresponding path program 11 times [2024-05-30 16:56:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515350405] [2024-05-30 16:56:21,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:21,505 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-30 16:56:21,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515350405] [2024-05-30 16:56:21,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515350405] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:21,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159332544] [2024-05-30 16:56:21,506 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:56:21,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:21,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:21,507 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:21,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-05-30 16:56:21,670 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2024-05-30 16:56:21,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:21,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 12 conjunts are in the unsatisfiable core [2024-05-30 16:56:21,675 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:21,838 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 72 proven. 50 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-30 16:56:21,839 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:22,366 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 52 proven. 70 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-30 16:56:22,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159332544] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:22,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:22,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 13] total 19 [2024-05-30 16:56:22,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288491845] [2024-05-30 16:56:22,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:22,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-05-30 16:56:22,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:22,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-05-30 16:56:22,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2024-05-30 16:56:22,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:22,369 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:22,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.736842105263158) internal successors, (242), 19 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:22,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:22,369 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:22,370 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:22,370 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:22,916 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1713 states. [2024-05-30 16:56:22,917 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:22,918 INFO L78 Accepts]: Start accepts. Automaton has currently 1714 states, but on-demand construction may add more states Word has length 192 [2024-05-30 16:56:22,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:22,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:23,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-05-30 16:56:23,126 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:23,127 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:23,127 INFO L85 PathProgramCache]: Analyzing trace with hash -298786499, now seen corresponding path program 12 times [2024-05-30 16:56:23,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:23,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650539821] [2024-05-30 16:56:23,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:23,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:25,564 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:25,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650539821] [2024-05-30 16:56:25,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650539821] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:25,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538414097] [2024-05-30 16:56:25,565 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:56:25,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:25,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:25,566 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:25,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-05-30 16:56:26,151 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2024-05-30 16:56:26,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:26,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 60 conjunts are in the unsatisfiable core [2024-05-30 16:56:26,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 317 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-05-30 16:56:27,141 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:27,241 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:56:27,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:56:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2024-05-30 16:56:27,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538414097] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:27,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:27,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 30, 17] total 64 [2024-05-30 16:56:27,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527413648] [2024-05-30 16:56:27,358 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:27,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-05-30 16:56:27,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:27,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-05-30 16:56:27,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=3816, Unknown=0, NotChecked=0, Total=4032 [2024-05-30 16:56:27,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:27,360 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:27,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.421875) internal successors, (347), 64 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:27,361 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:27,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:27,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:27,362 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:27,362 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:32,022 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 1737 states. [2024-05-30 16:56:32,022 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:32,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:32,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:32,024 INFO L78 Accepts]: Start accepts. Automaton has currently 1738 states, but on-demand construction may add more states Word has length 204 [2024-05-30 16:56:32,026 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:32,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:32,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-05-30 16:56:32,226 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:32,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:32,227 INFO L85 PathProgramCache]: Analyzing trace with hash 799633508, now seen corresponding path program 13 times [2024-05-30 16:56:32,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:32,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695709934] [2024-05-30 16:56:32,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:32,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:32,448 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 98 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-30 16:56:32,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695709934] [2024-05-30 16:56:32,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695709934] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:32,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940479127] [2024-05-30 16:56:32,449 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-05-30 16:56:32,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:32,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:32,452 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:32,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-05-30 16:56:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:32,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 14 conjunts are in the unsatisfiable core [2024-05-30 16:56:32,595 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 98 proven. 72 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-30 16:56:32,792 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:33,341 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 74 proven. 96 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-05-30 16:56:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940479127] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:33,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:33,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 15] total 22 [2024-05-30 16:56:33,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365235462] [2024-05-30 16:56:33,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:33,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-05-30 16:56:33,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-05-30 16:56:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=294, Unknown=0, NotChecked=0, Total=462 [2024-05-30 16:56:33,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:33,344 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:33,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 11.727272727272727) internal successors, (258), 22 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:33,344 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:33,345 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:33,345 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:33,828 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2193 states. [2024-05-30 16:56:33,829 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:33,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:33,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:56:33,832 INFO L78 Accepts]: Start accepts. Automaton has currently 2194 states, but on-demand construction may add more states Word has length 208 [2024-05-30 16:56:33,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:33,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-05-30 16:56:34,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-05-30 16:56:34,037 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:34,037 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:34,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2092183081, now seen corresponding path program 14 times [2024-05-30 16:56:34,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:34,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124786174] [2024-05-30 16:56:34,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:34,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:34,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:36,902 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:36,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124786174] [2024-05-30 16:56:36,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124786174] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:36,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784536795] [2024-05-30 16:56:36,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-05-30 16:56:36,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:36,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:36,903 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:36,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-05-30 16:56:37,041 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-05-30 16:56:37,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:37,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 75 conjunts are in the unsatisfiable core [2024-05-30 16:56:37,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:38,882 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:39,306 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:56:39,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:56:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:42,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784536795] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:42,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:42,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 39, 39] total 109 [2024-05-30 16:56:42,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697350546] [2024-05-30 16:56:42,131 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:42,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2024-05-30 16:56:42,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:42,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2024-05-30 16:56:42,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1217, Invalid=10555, Unknown=0, NotChecked=0, Total=11772 [2024-05-30 16:56:42,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:42,136 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:42,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 4.871559633027523) internal successors, (531), 109 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:42,137 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:42,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:42,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:42,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:42,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:56:42,138 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:42,138 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:51,333 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2217 states. [2024-05-30 16:56:51,334 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:56:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:56:51,335 INFO L78 Accepts]: Start accepts. Automaton has currently 2218 states, but on-demand construction may add more states Word has length 220 [2024-05-30 16:56:51,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:51,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:51,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-05-30 16:56:51,537 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:51,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1975196848, now seen corresponding path program 15 times [2024-05-30 16:56:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:51,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734871821] [2024-05-30 16:56:51,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:51,821 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 128 proven. 98 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-30 16:56:51,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734871821] [2024-05-30 16:56:51,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734871821] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290212240] [2024-05-30 16:56:51,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-05-30 16:56:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:51,824 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:51,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-05-30 16:56:52,341 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-05-30 16:56:52,342 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:52,344 INFO L262 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 16 conjunts are in the unsatisfiable core [2024-05-30 16:56:52,347 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 128 proven. 98 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-30 16:56:52,527 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 100 proven. 126 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2024-05-30 16:56:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1290212240] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:56:53,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:56:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 17] total 25 [2024-05-30 16:56:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573235745] [2024-05-30 16:56:53,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:56:53,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-05-30 16:56:53,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:56:53,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-05-30 16:56:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=384, Unknown=0, NotChecked=0, Total=600 [2024-05-30 16:56:53,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:53,154 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:56:53,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.96) internal successors, (274), 25 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:53,154 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:56:53,155 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:53,155 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:56:53,975 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2736 states. [2024-05-30 16:56:53,975 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:56:53,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:56:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:56:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:56:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:56:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:56:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:56:53,976 INFO L78 Accepts]: Start accepts. Automaton has currently 2737 states, but on-demand construction may add more states Word has length 224 [2024-05-30 16:56:53,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:56:53,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-05-30 16:56:54,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,17 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:54,178 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:56:54,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:56:54,179 INFO L85 PathProgramCache]: Analyzing trace with hash 337734421, now seen corresponding path program 16 times [2024-05-30 16:56:54,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:56:54,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431847101] [2024-05-30 16:56:54,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:56:54,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:56:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:56:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:57,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:56:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431847101] [2024-05-30 16:56:57,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431847101] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:56:57,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920301032] [2024-05-30 16:56:57,072 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-05-30 16:56:57,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:56:57,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:56:57,075 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:56:57,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-05-30 16:56:57,220 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-05-30 16:56:57,220 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:56:57,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 83 conjunts are in the unsatisfiable core [2024-05-30 16:56:57,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:56:59,224 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:56:59,225 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:56:59,722 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-05-30 16:56:59,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 13 [2024-05-30 16:57:02,816 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:57:02,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920301032] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:57:02,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:57:02,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 43, 43] total 121 [2024-05-30 16:57:02,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663924369] [2024-05-30 16:57:02,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:57:02,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 121 states [2024-05-30 16:57:02,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:57:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2024-05-30 16:57:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1737, Invalid=12783, Unknown=0, NotChecked=0, Total=14520 [2024-05-30 16:57:02,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:02,822 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:57:02,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 121 states, 121 states have (on average 4.785123966942149) internal successors, (579), 121 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:02,822 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:57:02,823 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:02,823 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:57:13,681 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 2760 states. [2024-05-30 16:57:13,681 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:57:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:57:13,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-05-30 16:57:13,683 INFO L78 Accepts]: Start accepts. Automaton has currently 2761 states, but on-demand construction may add more states Word has length 236 [2024-05-30 16:57:13,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:57:13,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-05-30 16:57:13,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,18 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:57:13,885 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:57:13,886 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:57:13,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1898297796, now seen corresponding path program 17 times [2024-05-30 16:57:13,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:57:13,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376115663] [2024-05-30 16:57:13,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:57:13,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:57:13,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:57:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 162 proven. 128 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-30 16:57:14,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:57:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376115663] [2024-05-30 16:57:14,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376115663] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:57:14,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174051039] [2024-05-30 16:57:14,202 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-05-30 16:57:14,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:57:14,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:57:14,204 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:57:14,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-05-30 16:57:14,422 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2024-05-30 16:57:14,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:57:14,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 18 conjunts are in the unsatisfiable core [2024-05-30 16:57:14,426 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:57:14,604 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 162 proven. 128 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-30 16:57:14,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:57:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 130 proven. 160 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-30 16:57:15,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174051039] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:57:15,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:57:15,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 19] total 28 [2024-05-30 16:57:15,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8125380] [2024-05-30 16:57:15,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:57:15,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-05-30 16:57:15,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:57:15,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-05-30 16:57:15,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=486, Unknown=0, NotChecked=0, Total=756 [2024-05-30 16:57:15,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:15,236 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:57:15,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.357142857142858) internal successors, (290), 28 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:57:15,236 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-05-30 16:57:15,237 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:15,237 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:57:16,161 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 3342 states. [2024-05-30 16:57:16,161 INFO L212 cStratifiedReduction]: Copied states 0 times. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:57:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:57:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:57:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2024-05-30 16:57:16,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:57:16,163 INFO L78 Accepts]: Start accepts. Automaton has currently 3343 states, but on-demand construction may add more states Word has length 240 [2024-05-30 16:57:16,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2024-05-30 16:57:16,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-05-30 16:57:16,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-05-30 16:57:16,366 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-05-30 16:57:16,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-05-30 16:57:16,366 INFO L85 PathProgramCache]: Analyzing trace with hash -209676287, now seen corresponding path program 18 times [2024-05-30 16:57:16,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-05-30 16:57:16,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441457870] [2024-05-30 16:57:16,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-05-30 16:57:16,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-05-30 16:57:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-05-30 16:57:19,717 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 0 proven. 694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-05-30 16:57:19,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-05-30 16:57:19,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441457870] [2024-05-30 16:57:19,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441457870] provided 0 perfect and 1 imperfect interpolant sequences [2024-05-30 16:57:19,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697641689] [2024-05-30 16:57:19,718 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-05-30 16:57:19,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 16:57:19,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2024-05-30 16:57:19,719 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-05-30 16:57:19,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-05-30 16:57:20,864 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2024-05-30 16:57:20,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-05-30 16:57:20,867 INFO L262 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 27 conjunts are in the unsatisfiable core [2024-05-30 16:57:20,870 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2024-05-30 16:57:22,187 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 144 proven. 180 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-30 16:57:22,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2024-05-30 16:57:23,321 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-05-30 16:57:23,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 11 [2024-05-30 16:57:24,115 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 112 proven. 212 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-05-30 16:57:24,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1697641689] provided 0 perfect and 2 imperfect interpolant sequences [2024-05-30 16:57:24,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-05-30 16:57:24,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 23, 23] total 88 [2024-05-30 16:57:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066005534] [2024-05-30 16:57:24,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-05-30 16:57:24,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2024-05-30 16:57:24,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-05-30 16:57:24,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2024-05-30 16:57:24,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=953, Invalid=6703, Unknown=0, NotChecked=0, Total=7656 [2024-05-30 16:57:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:24,120 INFO L495 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2024-05-30 16:57:24,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 5.681818181818182) internal successors, (500), 88 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 29 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 32 states. [2024-05-30 16:57:24,120 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 46 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 48 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 65 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 87 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 78 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 115 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 129 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 12 states. [2024-05-30 16:57:24,121 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2024-05-30 16:57:24,121 INFO L199 cStratifiedReduction]: Start building reduction automaton [2024-05-30 16:57:30,800 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,800 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:30,800 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,807 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,807 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,807 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,846 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,847 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,847 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,874 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,913 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,914 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,914 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,940 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,940 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,940 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,963 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,963 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,963 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,977 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:30,977 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:30,977 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,874 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,874 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,874 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,882 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,882 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,882 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,891 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,892 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,892 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,892 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,892 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:32,892 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,904 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,904 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,904 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,910 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,910 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:32,910 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,911 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,911 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,911 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,920 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,920 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:32,920 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,932 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,933 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,933 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,962 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,962 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:32,962 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,975 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:32,975 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:32,975 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,003 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,004 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,004 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,018 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,018 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,018 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,046 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,046 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,046 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,059 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,059 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,060 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,090 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,091 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,091 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,104 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,105 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,105 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,147 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,147 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,148 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,161 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,162 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,162 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,194 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,194 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,194 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,209 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,209 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,209 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,241 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,242 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,242 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,256 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,256 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,256 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,291 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,291 INFO L394 cStratifiedReduction]: Guessed abstraction level: [] [2024-05-30 16:57:33,291 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,307 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:33,307 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:33,307 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,709 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,709 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,709 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,710 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,710 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,710 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,710 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,710 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,710 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,711 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,711 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,711 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,712 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,712 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,713 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,713 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,713 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,714 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,714 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,714 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:34,714 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:34,714 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,662 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,662 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,662 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,663 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,663 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,663 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,664 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,664 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,664 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,665 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,665 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,665 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,666 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,666 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,666 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,667 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,667 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,667 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,668 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,668 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,668 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,669 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:37,669 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:37,669 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,882 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:40,882 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,882 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,915 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:40,915 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,915 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,952 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:40,952 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,952 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,988 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:40,989 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:40,989 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,019 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:41,020 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,020 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,050 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:41,050 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,050 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,081 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:41,081 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,081 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,112 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:41,112 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:41,112 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:47,996 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:47,996 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:47,996 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,034 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,034 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,034 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,073 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,073 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,073 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,111 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,111 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,111 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,150 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,150 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,150 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,189 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,189 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,189 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,228 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:48,228 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:48,228 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,388 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,388 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,388 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,576 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,576 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,576 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,643 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,643 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,644 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,748 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,748 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,748 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,840 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,840 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,840 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,911 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:57:56,911 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:57:56,911 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:06,901 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:06,901 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:06,901 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,046 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:07,046 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,047 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,216 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:07,217 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,217 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,356 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:07,356 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,356 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,507 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:07,508 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:07,508 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:18,933 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:18,933 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:18,933 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,017 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:19,018 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,018 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,105 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:19,106 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,106 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,191 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:19,191 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:19,191 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,002 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:24,002 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,002 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,146 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:24,146 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,146 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,285 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:24,285 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:24,285 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:28,105 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:28,106 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:28,106 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:28,254 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:28,254 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:28,254 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:30,013 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:30,013 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:30,013 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,674 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,674 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,674 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,681 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,682 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,682 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,689 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,689 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,689 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,697 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,697 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,697 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,705 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,705 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,705 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,712 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,712 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,712 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,719 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:32,720 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:32,720 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,040 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:49,040 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,040 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,219 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:49,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,219 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,411 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:49,411 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,411 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,592 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:49,592 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,593 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,774 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:49,774 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:49,774 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:50,005 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:50,005 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:50,005 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:50,196 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:58:50,197 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:58:50,197 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,431 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:20,431 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,431 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,642 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:20,643 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,643 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,861 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:20,861 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:20,861 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,077 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:21,077 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,077 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,293 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:21,293 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,293 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,525 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:21,525 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:21,525 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,065 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:47,065 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,065 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,353 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:47,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,354 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,635 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:47,635 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,635 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,899 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:47,899 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:47,899 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:48,174 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 16:59:48,174 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 16:59:48,174 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:08,993 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:08,993 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:08,993 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,271 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:09,272 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,272 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,552 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:09,552 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,552 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,833 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:09,833 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:09,833 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:23,609 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:23,609 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:23,610 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:23,889 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:23,889 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:23,889 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:24,168 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:24,168 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:24,168 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:31,990 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:31,990 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:31,990 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:32,312 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:32,312 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:32,313 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:35,801 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:35,801 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:35,801 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:58,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:58,811 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:58,811 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,108 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:59,108 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,108 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,406 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:59,406 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,407 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,716 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:00:59,717 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:00:59,717 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:00,030 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:00,030 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:00,030 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:00,343 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:00,343 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:00,343 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,047 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:35,047 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,047 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,352 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:35,353 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,353 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,656 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:35,657 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,657 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,980 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:35,980 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:35,981 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:36,311 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:01:36,311 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:01:36,311 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:02,995 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:02,995 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:02,995 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:03,544 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:03,545 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:03,545 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:03,881 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:03,881 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:03,881 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:04,231 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:04,231 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:04,231 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:21,723 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:21,723 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:21,723 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:22,121 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:22,122 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:22,122 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:22,520 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:22,520 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:22,520 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:32,228 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:32,228 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:32,228 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:32,593 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:32,593 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:32,594 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:36,469 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:36,469 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:36,470 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:59,591 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:59,591 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:59,592 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:59,969 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:02:59,969 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:02:59,969 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:00,362 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:00,363 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:00,363 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:00,748 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:00,748 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:00,748 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:01,120 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:01,120 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:01,120 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:31,389 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:31,389 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:31,389 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:31,782 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:31,782 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:31,782 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:32,165 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:32,165 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:32,165 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:32,549 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:32,550 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:32,550 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,001 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:52,001 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,001 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,427 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:52,428 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,428 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,837 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:03:52,837 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:03:52,837 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:03,615 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:03,616 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:03,616 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:04,055 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:04,055 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:04,055 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:08,801 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:08,801 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:08,801 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:27,383 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:27,383 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:27,383 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:27,985 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:27,986 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:27,986 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:28,397 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:28,397 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:28,397 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:28,811 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:28,811 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:28,812 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:50,218 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:50,219 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:50,219 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:50,669 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:50,670 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:50,670 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:51,267 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:04:51,268 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:04:51,268 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:02,945 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:02,945 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:02,945 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:03,448 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:03,448 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:03,448 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:08,455 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:08,455 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:08,455 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:22,145 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:22,145 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:22,145 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:22,606 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:22,606 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:22,606 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:23,051 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:23,051 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:23,051 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:35,447 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:35,447 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:35,447 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:35,967 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:35,968 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:35,968 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:40,806 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:40,807 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:40,807 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:49,259 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:49,259 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:49,259 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:49,753 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:49,753 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:49,753 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:54,858 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:54,859 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:54,859 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:58,930 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:05:58,930 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:05:58,930 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,716 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,716 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,716 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,746 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,746 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,746 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,776 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,776 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,776 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,807 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,808 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,808 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,837 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,837 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,837 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,867 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:05,867 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:05,867 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:46,755 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:46,755 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:46,755 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:47,251 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:47,251 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:47,251 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:47,759 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:47,759 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:47,759 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:48,249 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:48,249 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:48,249 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:48,747 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:48,747 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:48,747 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:49,246 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:06:49,247 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:06:49,247 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:46,735 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:46,735 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:46,735 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:47,263 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:47,263 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:47,263 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:47,782 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:47,782 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:47,782 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:48,304 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:48,304 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:48,304 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:48,831 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:07:48,831 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:07:48,831 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:28,078 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:28,078 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:28,078 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:28,611 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:28,612 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:28,612 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:29,150 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:29,151 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:29,151 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:29,697 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:29,698 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:29,698 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:54,184 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:54,184 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:54,184 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:54,678 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:54,678 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:54,678 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:55,169 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:08:55,169 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:08:55,169 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:08,174 INFO L393 cStratifiedReduction]: Backtracking a loop entry edge [2024-05-30 17:09:08,174 INFO L394 cStratifiedReduction]: Guessed abstraction level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] [2024-05-30 17:09:08,174 INFO L395 cStratifiedReduction]: Actual level: [ULTIMATE.start_create_fresh_int_array_~i~0#1, ULTIMATE.start_create_fresh_int_array_#t~malloc16#1.offset, ULTIMATE.start_create_fresh_int_array_~size#1, ~queue~0.offset, ULTIMATE.start_create_fresh_int_array_#res#1.offset, ~front~0, ULTIMATE.start_create_fresh_int_array_#in~size#1, ULTIMATE.start_assume_abort_if_not_~cond#1, ~n~0, ~x~0, ~back~0, ULTIMATE.start_main_#t~ret9#1.offset, ULTIMATE.start_assume_abort_if_not_#in~cond#1, ~queue~0.base, ULTIMATE.start_create_fresh_int_array_#t~post17#1, #memory_int, ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset] Received shutdown request... [2024-05-30 17:09:08,379 INFO L211 cStratifiedReduction]: Finished building reduction automaton with 169037 states. [2024-05-30 17:09:08,379 INFO L212 cStratifiedReduction]: Copied states 573 times. [2024-05-30 17:09:08,384 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-05-30 17:09:08,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-05-30 17:09:08,405 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2024-05-30 17:09:08,405 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-05-30 17:09:08,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,20 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-05-30 17:09:08,580 WARN L619 AbstractCegarLoop]: Verification canceled: while executing DynamicStratifiedReduction. [2024-05-30 17:09:08,582 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-05-30 17:09:08,704 INFO L445 BasicCegarLoop]: Path program histogram: [18, 1, 1, 1, 1] [2024-05-30 17:09:08,706 INFO L308 ceAbstractionStarter]: Result for error location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION was TIMEOUT (1/3) [2024-05-30 17:09:08,708 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-05-30 17:09:08,708 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-05-30 17:09:08,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.05 05:09:08 BasicIcfg [2024-05-30 17:09:08,710 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-05-30 17:09:08,711 INFO L158 Benchmark]: Toolchain (without parser) took 818635.33ms. Allocated memory was 296.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 228.1MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-05-30 17:09:08,711 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 168.8MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. [2024-05-30 17:09:08,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.13ms. Allocated memory is still 296.7MB. Free memory was 227.9MB in the beginning and 216.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2024-05-30 17:09:08,712 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.90ms. Allocated memory is still 296.7MB. Free memory was 215.9MB in the beginning and 214.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-05-30 17:09:08,712 INFO L158 Benchmark]: Boogie Preprocessor took 25.95ms. Allocated memory is still 296.7MB. Free memory was 214.1MB in the beginning and 212.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2024-05-30 17:09:08,712 INFO L158 Benchmark]: RCFGBuilder took 539.88ms. Allocated memory is still 296.7MB. Free memory was 212.4MB in the beginning and 250.3MB in the end (delta: -37.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2024-05-30 17:09:08,712 INFO L158 Benchmark]: TraceAbstraction took 817806.61ms. Allocated memory was 296.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 249.3MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. [2024-05-30 17:09:08,714 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.12ms. Allocated memory is still 168.8MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 219.13ms. Allocated memory is still 296.7MB. Free memory was 227.9MB in the beginning and 216.1MB in the end (delta: 11.8MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.90ms. Allocated memory is still 296.7MB. Free memory was 215.9MB in the beginning and 214.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.95ms. Allocated memory is still 296.7MB. Free memory was 214.1MB in the beginning and 212.6MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 539.88ms. Allocated memory is still 296.7MB. Free memory was 212.4MB in the beginning and 250.3MB in the end (delta: -37.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 817806.61ms. Allocated memory was 296.7MB in the beginning and 3.0GB in the end (delta: 2.7GB). Free memory was 249.3MB in the beginning and 2.0GB in the end (delta: -1.7GB). Peak memory consumption was 1.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation #1 benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 205914, independent: 181350, independent conditional: 181350, independent unconditional: 0, dependent: 24564, dependent conditional: 24564, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 183097, independent: 181350, independent conditional: 181350, independent unconditional: 0, dependent: 1747, dependent conditional: 1747, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 183097, independent: 181350, independent conditional: 181350, independent unconditional: 0, dependent: 1747, dependent conditional: 1747, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 221531, independent: 181350, independent conditional: 0, independent unconditional: 181350, dependent: 40181, dependent conditional: 38434, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 221531, independent: 181350, independent conditional: 0, independent unconditional: 181350, dependent: 40181, dependent conditional: 0, dependent unconditional: 40181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 221531, independent: 181350, independent conditional: 0, independent unconditional: 181350, dependent: 40181, dependent conditional: 0, dependent unconditional: 40181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 183097, independent: 181350, independent conditional: 0, independent unconditional: 181350, dependent: 1747, dependent conditional: 0, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 183097, independent: 181350, independent conditional: 0, independent unconditional: 181350, dependent: 1747, dependent conditional: 0, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 1747, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1747, dependent conditional: 0, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1747, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1747, dependent conditional: 0, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 1747, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 1747, dependent conditional: 0, dependent unconditional: 1747, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 2544, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 2544, dependent conditional: 0, dependent unconditional: 2544, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Protected Queries: 0 ], Cache Queries: [ total: 221531, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 38434, dependent conditional: 0, dependent unconditional: 38434, unknown: 183097, unknown conditional: 0, unknown unconditional: 183097] , Statistics on independence cache: Total cache size (in pairs): 183097, Positive cache size: 181350, Positive conditional cache size: 0, Positive unconditional cache size: 181350, Negative cache size: 1747, Negative conditional cache size: 0, Negative unconditional cache size: 1747, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38434, Maximal queried relation: 22, Independence queries for same thread: 22817 - StatisticsResult: Reduction benchmarks 17.6ms Time before loop, 39.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 140, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 12.3ms Time before loop, 22.0ms Time in loop, 0.0s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 146, Duplicate States: 0, Protected Variables: 0 - StatisticsResult: Reduction benchmarks 55.2ms Time before loop, 66.9ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 161, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 16.8ms Time before loop, 121.3ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 241, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 77.7ms Time before loop, 85.9ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 249, Duplicate States: 0, Protected Variables: 3 - StatisticsResult: Reduction benchmarks 684.7ms Time before loop, 431.7ms Time in loop, 1.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 273, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 19.9ms Time before loop, 110.5ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 414, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 1301.0ms Time before loop, 297.3ms Time in loop, 1.6s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 423, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 972.7ms Time before loop, 818.5ms Time in loop, 1.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 447, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 21.0ms Time before loop, 127.4ms Time in loop, 0.1s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 651, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 1068.9ms Time before loop, 806.9ms Time in loop, 1.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 675, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 20.6ms Time before loop, 159.4ms Time in loop, 0.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 942, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2951.2ms Time before loop, 2512.2ms Time in loop, 5.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 966, Duplicate States: 0, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 22.0ms Time before loop, 249.2ms Time in loop, 0.3s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1296, Duplicate States: 0, Protected Variables: 24 - StatisticsResult: Reduction benchmarks 2386.3ms Time before loop, 3475.5ms Time in loop, 5.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1320, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 21.8ms Time before loop, 524.1ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1713, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2169.6ms Time before loop, 2490.7ms Time in loop, 4.7s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 1737, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 32.1ms Time before loop, 451.4ms Time in loop, 0.5s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2193, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 3505.7ms Time before loop, 5689.6ms Time in loop, 9.2s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2217, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 31.9ms Time before loop, 787.2ms Time in loop, 0.8s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2736, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 4048.8ms Time before loop, 6809.4ms Time in loop, 10.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 2760, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 23.6ms Time before loop, 900.6ms Time in loop, 0.9s Time in total, Has Loop: 1, wrong guesses: 0, overall guesses: 1, Reduction States: 3342, Duplicate States: 0, Protected Variables: 17 - StatisticsResult: Reduction benchmarks 2770.6ms Time before loop, 701486.9ms Time in loop, 704.3s Time in total, Has Loop: 1, wrong guesses: 12, overall guesses: 204, Reduction States: 169037, Duplicate States: 573, Protected Variables: 17 - StatisticsResult: Visitor Statistics States: 99, Transitions: 99, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 99, Transitions: 102, Traversal time: 0.0s - StatisticsResult: Visitor Statistics States: 113, Transitions: 118, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 179, Transitions: 200, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 186, Transitions: 207, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 208, Transitions: 231, Traversal time: 1.1s - StatisticsResult: Visitor Statistics States: 336, Transitions: 384, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 344, Transitions: 392, Traversal time: 1.6s - StatisticsResult: Visitor Statistics States: 366, Transitions: 416, Traversal time: 1.8s - StatisticsResult: Visitor Statistics States: 556, Transitions: 640, Traversal time: 0.1s - StatisticsResult: Visitor Statistics States: 578, Transitions: 664, Traversal time: 1.9s - StatisticsResult: Visitor Statistics States: 830, Transitions: 959, Traversal time: 0.2s - StatisticsResult: Visitor Statistics States: 852, Transitions: 983, Traversal time: 5.5s - StatisticsResult: Visitor Statistics States: 1166, Transitions: 1349, Traversal time: 0.3s - StatisticsResult: Visitor Statistics States: 1188, Transitions: 1373, Traversal time: 5.9s - StatisticsResult: Visitor Statistics States: 1564, Transitions: 1810, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 1586, Transitions: 1834, Traversal time: 4.7s - StatisticsResult: Visitor Statistics States: 2024, Transitions: 2342, Traversal time: 0.5s - StatisticsResult: Visitor Statistics States: 2046, Transitions: 2366, Traversal time: 9.2s - StatisticsResult: Visitor Statistics States: 2546, Transitions: 2945, Traversal time: 0.8s - StatisticsResult: Visitor Statistics States: 2568, Transitions: 2969, Traversal time: 10.9s - StatisticsResult: Visitor Statistics States: 3130, Transitions: 3619, Traversal time: 0.9s - StatisticsResult: Visitor Statistics States: 167805, Transitions: 203402, Traversal time: 704.3s - StatisticsResult: Proof manager benchmarks IrresponsibleProofs: 157, RedundantProofs: 20, ProvenStates: 27826, Times there's more than one choice: 27115, Avg number of choices: 19.530654783296196 - TimeoutResultAtElement [Line: 86]: 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, 132 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 817.6s, OverallIterations: 22, TraceHistogramMax: 0, PathProgramHistogramMax: 18, EmptinessCheckTime: 750.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: 920, 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.4s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 56.3s InterpolantComputationTime, 6623 NumberOfCodeBlocks, 6529 NumberOfCodeBlocksAsserted, 100 NumberOfCheckSat, 9693 ConstructedInterpolants, 145 QuantifiedInterpolants, 86470 SizeOfPredicates, 253 NumberOfNonLiveVariables, 6221 ConjunctsInSsa, 575 ConjunctsInUnsatCore, 58 InterpolantComputations, 4 PerfectInterpolantSequences, 6862/14568 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