/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 23:43:06,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 23:43:06,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 23:43:06,143 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 23:43:06,144 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 23:43:06,165 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 23:43:06,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 23:43:06,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 23:43:06,166 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 23:43:06,169 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 23:43:06,169 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 23:43:06,169 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 23:43:06,170 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 23:43:06,170 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 23:43:06,171 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 23:43:06,171 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 23:43:06,171 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 23:43:06,171 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 23:43:06,171 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 23:43:06,172 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 23:43:06,172 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 23:43:06,172 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 23:43:06,173 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 23:43:06,174 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 23:43:06,174 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 23:43:06,174 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 23:43:06,175 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 23:43:06,175 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 23:43:06,176 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 23:43:06,176 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 23:43:06,176 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 23:43:06,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 23:43:06,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 23:43:06,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 23:43:06,397 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 23:43:06,398 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 23:43:06,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2023-12-19 23:43:07,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 23:43:07,599 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 23:43:07,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c [2023-12-19 23:43:07,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8f9236/ea8d75d8b6754eedbdcb1ba28b187e2b/FLAG28d52fcef [2023-12-19 23:43:07,616 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc8f9236/ea8d75d8b6754eedbdcb1ba28b187e2b [2023-12-19 23:43:07,618 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 23:43:07,619 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 23:43:07,621 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 23:43:07,621 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 23:43:07,624 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 23:43:07,625 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,626 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a554926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07, skipping insertion in model container [2023-12-19 23:43:07,626 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,640 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 23:43:07,756 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-12-19 23:43:07,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 23:43:07,769 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 23:43:07,779 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_10-2.c[949,962] [2023-12-19 23:43:07,780 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 23:43:07,788 INFO L206 MainTranslator]: Completed translation [2023-12-19 23:43:07,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07 WrapperNode [2023-12-19 23:43:07,789 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 23:43:07,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 23:43:07,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 23:43:07,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 23:43:07,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,797 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,807 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 20 [2023-12-19 23:43:07,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 23:43:07,808 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 23:43:07,808 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 23:43:07,808 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 23:43:07,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,815 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,821 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 23:43:07,821 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 23:43:07,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 23:43:07,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 23:43:07,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 23:43:07,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (1/1) ... [2023-12-19 23:43:07,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 23:43:07,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:07,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 23:43:07,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 23:43:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 23:43:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 23:43:07,877 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2023-12-19 23:43:07,877 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2023-12-19 23:43:07,878 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2023-12-19 23:43:07,878 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2023-12-19 23:43:07,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 23:43:07,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 23:43:07,917 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 23:43:07,919 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 23:43:08,035 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 23:43:08,048 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 23:43:08,048 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-12-19 23:43:08,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:43:08 BoogieIcfgContainer [2023-12-19 23:43:08,049 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 23:43:08,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 23:43:08,051 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 23:43:08,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 23:43:08,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 11:43:07" (1/3) ... [2023-12-19 23:43:08,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5635f0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:43:08, skipping insertion in model container [2023-12-19 23:43:08,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 11:43:07" (2/3) ... [2023-12-19 23:43:08,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5635f0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 11:43:08, skipping insertion in model container [2023-12-19 23:43:08,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 11:43:08" (3/3) ... [2023-12-19 23:43:08,054 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_2calls_10-2.c [2023-12-19 23:43:08,065 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 23:43:08,065 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 23:43:08,092 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 23:43:08,096 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=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@9d73ceb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 23:43:08,096 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 23:43:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-19 23:43:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-19 23:43:08,103 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:08,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:08,104 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:08,107 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:08,107 INFO L85 PathProgramCache]: Analyzing trace with hash -389521846, now seen corresponding path program 1 times [2023-12-19 23:43:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:08,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2693901] [2023-12-19 23:43:08,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:08,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 23:43:08,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:08,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2693901] [2023-12-19 23:43:08,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2693901] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 23:43:08,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 23:43:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 23:43:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089675342] [2023-12-19 23:43:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 23:43:08,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 23:43:08,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 23:43:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:43:08,294 INFO L87 Difference]: Start difference. First operand has 26 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 23:43:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:08,348 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2023-12-19 23:43:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 23:43:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-12-19 23:43:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:08,354 INFO L225 Difference]: With dead ends: 35 [2023-12-19 23:43:08,355 INFO L226 Difference]: Without dead ends: 26 [2023-12-19 23:43:08,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:43:08,358 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:08,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 23:43:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-19 23:43:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-19 23:43:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 23:43:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-19 23:43:08,381 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2023-12-19 23:43:08,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:08,381 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-19 23:43:08,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 23:43:08,382 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-19 23:43:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-19 23:43:08,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:08,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:08,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 23:43:08,383 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:08,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:08,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1524884472, now seen corresponding path program 1 times [2023-12-19 23:43:08,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:08,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501211622] [2023-12-19 23:43:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:08,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 23:43:08,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:08,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501211622] [2023-12-19 23:43:08,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501211622] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 23:43:08,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 23:43:08,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 23:43:08,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121942097] [2023-12-19 23:43:08,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 23:43:08,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 23:43:08,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:08,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 23:43:08,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:43:08,445 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 23:43:08,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:08,472 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2023-12-19 23:43:08,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 23:43:08,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-12-19 23:43:08,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:08,474 INFO L225 Difference]: With dead ends: 32 [2023-12-19 23:43:08,474 INFO L226 Difference]: Without dead ends: 28 [2023-12-19 23:43:08,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 23:43:08,475 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:08,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 23:43:08,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-19 23:43:08,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2023-12-19 23:43:08,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 5 states have call predecessors, (7), 5 states have call successors, (7) [2023-12-19 23:43:08,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2023-12-19 23:43:08,480 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2023-12-19 23:43:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:08,480 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2023-12-19 23:43:08,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-19 23:43:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2023-12-19 23:43:08,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-19 23:43:08,481 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:08,481 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:08,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 23:43:08,482 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:08,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:08,482 INFO L85 PathProgramCache]: Analyzing trace with hash 741502751, now seen corresponding path program 1 times [2023-12-19 23:43:08,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:08,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334051782] [2023-12-19 23:43:08,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:08,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:08,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 23:43:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334051782] [2023-12-19 23:43:08,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334051782] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:08,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434834902] [2023-12-19 23:43:08,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:08,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:08,612 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 23:43:08,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:08,647 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 23:43:08,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:08,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:08,722 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:08,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [434834902] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:08,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:08,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2023-12-19 23:43:08,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102807948] [2023-12-19 23:43:08,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:08,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 23:43:08,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:08,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 23:43:08,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-12-19 23:43:08,903 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-19 23:43:09,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:09,039 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2023-12-19 23:43:09,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 23:43:09,039 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 22 [2023-12-19 23:43:09,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:09,042 INFO L225 Difference]: With dead ends: 54 [2023-12-19 23:43:09,042 INFO L226 Difference]: Without dead ends: 30 [2023-12-19 23:43:09,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-12-19 23:43:09,046 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:09,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:43:09,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-12-19 23:43:09,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2023-12-19 23:43:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 20 states have internal predecessors, (22), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-12-19 23:43:09,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2023-12-19 23:43:09,057 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 22 [2023-12-19 23:43:09,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:09,058 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2023-12-19 23:43:09,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 3.1) internal successors, (31), 13 states have internal predecessors, (31), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-19 23:43:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2023-12-19 23:43:09,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-19 23:43:09,061 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:09,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:09,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 23:43:09,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:09,271 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:09,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:09,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1785876995, now seen corresponding path program 1 times [2023-12-19 23:43:09,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:09,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337006005] [2023-12-19 23:43:09,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:09,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:09,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:09,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337006005] [2023-12-19 23:43:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337006005] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107777183] [2023-12-19 23:43:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:09,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:09,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:09,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:09,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 23:43:09,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-19 23:43:09,414 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:09,447 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:09,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 23:43:09,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107777183] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:09,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:09,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2023-12-19 23:43:09,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653108794] [2023-12-19 23:43:09,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:09,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 23:43:09,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:09,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 23:43:09,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-12-19 23:43:09,596 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 23:43:09,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:09,715 INFO L93 Difference]: Finished difference Result 50 states and 70 transitions. [2023-12-19 23:43:09,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 23:43:09,715 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 23 [2023-12-19 23:43:09,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:09,721 INFO L225 Difference]: With dead ends: 50 [2023-12-19 23:43:09,721 INFO L226 Difference]: Without dead ends: 46 [2023-12-19 23:43:09,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2023-12-19 23:43:09,724 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:09,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:43:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-19 23:43:09,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2023-12-19 23:43:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 30 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (15), 9 states have call predecessors, (15), 9 states have call successors, (15) [2023-12-19 23:43:09,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2023-12-19 23:43:09,732 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 23 [2023-12-19 23:43:09,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:09,733 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2023-12-19 23:43:09,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 13 states have internal predecessors, (31), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 23:43:09,733 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2023-12-19 23:43:09,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-19 23:43:09,734 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:09,734 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:09,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:09,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-12-19 23:43:09,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:09,937 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:09,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1754399412, now seen corresponding path program 1 times [2023-12-19 23:43:09,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:09,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323010453] [2023-12-19 23:43:09,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:09,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:09,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:10,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-12-19 23:43:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-12-19 23:43:10,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,076 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-19 23:43:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323010453] [2023-12-19 23:43:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323010453] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:10,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763271351] [2023-12-19 23:43:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:10,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:10,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:10,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:10,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 23:43:10,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 23:43:10,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:10,190 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-19 23:43:10,190 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:10,453 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 23:43:10,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763271351] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:10,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:10,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2023-12-19 23:43:10,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795388746] [2023-12-19 23:43:10,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:10,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 23:43:10,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:10,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 23:43:10,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2023-12-19 23:43:10,455 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-19 23:43:10,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:10,663 INFO L93 Difference]: Finished difference Result 104 states and 166 transitions. [2023-12-19 23:43:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 23:43:10,664 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) Word has length 35 [2023-12-19 23:43:10,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:10,667 INFO L225 Difference]: With dead ends: 104 [2023-12-19 23:43:10,667 INFO L226 Difference]: Without dead ends: 62 [2023-12-19 23:43:10,670 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 74 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2023-12-19 23:43:10,670 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 53 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:10,671 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 125 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:43:10,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-12-19 23:43:10,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-12-19 23:43:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 12 states have call successors, (12), 5 states have call predecessors, (12), 9 states have return successors, (29), 13 states have call predecessors, (29), 12 states have call successors, (29) [2023-12-19 23:43:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 91 transitions. [2023-12-19 23:43:10,689 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 91 transitions. Word has length 35 [2023-12-19 23:43:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:10,689 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 91 transitions. [2023-12-19 23:43:10,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 3.8333333333333335) internal successors, (46), 15 states have internal predecessors, (46), 11 states have call successors, (13), 1 states have call predecessors, (13), 5 states have return successors, (13), 3 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-19 23:43:10,689 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 91 transitions. [2023-12-19 23:43:10,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-19 23:43:10,695 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:10,695 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:10,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:10,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:10,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:10,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:10,900 INFO L85 PathProgramCache]: Analyzing trace with hash 2101254926, now seen corresponding path program 1 times [2023-12-19 23:43:10,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:10,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7638894] [2023-12-19 23:43:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-12-19 23:43:11,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:11,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7638894] [2023-12-19 23:43:11,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7638894] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910277669] [2023-12-19 23:43:11,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:11,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:11,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:11,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:11,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 23:43:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 23:43:11,059 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-19 23:43:11,120 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:11,345 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 23:43:11,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910277669] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:11,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:11,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 18 [2023-12-19 23:43:11,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242845866] [2023-12-19 23:43:11,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:11,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 23:43:11,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:11,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 23:43:11,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2023-12-19 23:43:11,347 INFO L87 Difference]: Start difference. First operand 62 states and 91 transitions. Second operand has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-19 23:43:11,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:11,607 INFO L93 Difference]: Finished difference Result 176 states and 320 transitions. [2023-12-19 23:43:11,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 23:43:11,608 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) Word has length 36 [2023-12-19 23:43:11,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:11,609 INFO L225 Difference]: With dead ends: 176 [2023-12-19 23:43:11,609 INFO L226 Difference]: Without dead ends: 116 [2023-12-19 23:43:11,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2023-12-19 23:43:11,611 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 37 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:11,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 282 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 23:43:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-19 23:43:11,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 102. [2023-12-19 23:43:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 65 states have (on average 1.2153846153846153) internal successors, (79), 68 states have internal predecessors, (79), 21 states have call successors, (21), 7 states have call predecessors, (21), 15 states have return successors, (65), 26 states have call predecessors, (65), 21 states have call successors, (65) [2023-12-19 23:43:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 165 transitions. [2023-12-19 23:43:11,622 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 165 transitions. Word has length 36 [2023-12-19 23:43:11,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:11,622 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 165 transitions. [2023-12-19 23:43:11,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.0625) internal successors, (49), 18 states have internal predecessors, (49), 11 states have call successors, (13), 1 states have call predecessors, (13), 7 states have return successors, (13), 6 states have call predecessors, (13), 11 states have call successors, (13) [2023-12-19 23:43:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 165 transitions. [2023-12-19 23:43:11,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-12-19 23:43:11,624 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:11,624 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:11,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:11,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:11,828 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:11,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:11,829 INFO L85 PathProgramCache]: Analyzing trace with hash 644290867, now seen corresponding path program 1 times [2023-12-19 23:43:11,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:11,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030343445] [2023-12-19 23:43:11,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:11,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:11,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:11,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 23:43:11,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2023-12-19 23:43:11,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030343445] [2023-12-19 23:43:11,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030343445] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:11,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758560017] [2023-12-19 23:43:11,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:11,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:11,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:11,992 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:12,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 23:43:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:12,029 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-19 23:43:12,032 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:12,098 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-12-19 23:43:12,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 28 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-19 23:43:12,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758560017] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:12,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 20 [2023-12-19 23:43:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435115172] [2023-12-19 23:43:12,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:12,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-19 23:43:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-19 23:43:12,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2023-12-19 23:43:12,498 INFO L87 Difference]: Start difference. First operand 102 states and 165 transitions. Second operand has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-19 23:43:12,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:12,731 INFO L93 Difference]: Finished difference Result 254 states and 494 transitions. [2023-12-19 23:43:12,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 23:43:12,731 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) Word has length 50 [2023-12-19 23:43:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:12,735 INFO L225 Difference]: With dead ends: 254 [2023-12-19 23:43:12,735 INFO L226 Difference]: Without dead ends: 154 [2023-12-19 23:43:12,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 107 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=662, Unknown=0, NotChecked=0, Total=812 [2023-12-19 23:43:12,737 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 45 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:12,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 254 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 23:43:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-19 23:43:12,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 108. [2023-12-19 23:43:12,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 70 states have (on average 1.2285714285714286) internal successors, (86), 71 states have internal predecessors, (86), 24 states have call successors, (24), 9 states have call predecessors, (24), 13 states have return successors, (66), 27 states have call predecessors, (66), 24 states have call successors, (66) [2023-12-19 23:43:12,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 176 transitions. [2023-12-19 23:43:12,770 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 176 transitions. Word has length 50 [2023-12-19 23:43:12,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:12,770 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 176 transitions. [2023-12-19 23:43:12,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.2777777777777777) internal successors, (59), 20 states have internal predecessors, (59), 14 states have call successors, (16), 1 states have call predecessors, (16), 8 states have return successors, (18), 7 states have call predecessors, (18), 14 states have call successors, (18) [2023-12-19 23:43:12,771 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 176 transitions. [2023-12-19 23:43:12,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-19 23:43:12,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:12,772 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:12,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:12,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:12,975 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:12,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:12,976 INFO L85 PathProgramCache]: Analyzing trace with hash 18580375, now seen corresponding path program 1 times [2023-12-19 23:43:12,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:12,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049979536] [2023-12-19 23:43:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:12,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:12,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:13,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:13,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:13,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:13,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 23:43:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:13,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,158 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 39 proven. 38 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2023-12-19 23:43:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049979536] [2023-12-19 23:43:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049979536] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974097680] [2023-12-19 23:43:13,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:13,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:13,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:13,160 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:13,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 23:43:13,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:13,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-19 23:43:13,224 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:13,311 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 68 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-19 23:43:13,311 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 12 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-19 23:43:13,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974097680] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:13,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:13,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 13] total 24 [2023-12-19 23:43:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556064646] [2023-12-19 23:43:13,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:13,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-19 23:43:13,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-19 23:43:13,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=464, Unknown=0, NotChecked=0, Total=552 [2023-12-19 23:43:13,951 INFO L87 Difference]: Start difference. First operand 108 states and 176 transitions. Second operand has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-19 23:43:14,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:14,291 INFO L93 Difference]: Finished difference Result 239 states and 461 transitions. [2023-12-19 23:43:14,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-19 23:43:14,291 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) Word has length 78 [2023-12-19 23:43:14,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:14,292 INFO L225 Difference]: With dead ends: 239 [2023-12-19 23:43:14,293 INFO L226 Difference]: Without dead ends: 106 [2023-12-19 23:43:14,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 164 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=1039, Unknown=0, NotChecked=0, Total=1260 [2023-12-19 23:43:14,294 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 78 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:14,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 260 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 23:43:14,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-19 23:43:14,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 83. [2023-12-19 23:43:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 57 states have internal predecessors, (66), 14 states have call successors, (14), 8 states have call predecessors, (14), 12 states have return successors, (35), 17 states have call predecessors, (35), 14 states have call successors, (35) [2023-12-19 23:43:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 115 transitions. [2023-12-19 23:43:14,300 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 115 transitions. Word has length 78 [2023-12-19 23:43:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:14,301 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 115 transitions. [2023-12-19 23:43:14,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.3181818181818183) internal successors, (73), 24 states have internal predecessors, (73), 18 states have call successors, (22), 1 states have call predecessors, (22), 9 states have return successors, (25), 11 states have call predecessors, (25), 18 states have call successors, (25) [2023-12-19 23:43:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 115 transitions. [2023-12-19 23:43:14,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-12-19 23:43:14,302 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:14,302 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 14, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:14,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-19 23:43:14,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:14,512 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:14,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:14,512 INFO L85 PathProgramCache]: Analyzing trace with hash 370437973, now seen corresponding path program 1 times [2023-12-19 23:43:14,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:14,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928941841] [2023-12-19 23:43:14,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:14,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:14,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 23:43:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-12-19 23:43:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 23:43:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 84 proven. 258 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2023-12-19 23:43:14,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928941841] [2023-12-19 23:43:14,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928941841] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:14,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2062610878] [2023-12-19 23:43:14,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:14,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:14,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:14,890 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:14,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 23:43:14,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:14,983 INFO L262 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-19 23:43:14,986 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 369 refuted. 0 times theorem prover too weak. 881 trivial. 0 not checked. [2023-12-19 23:43:15,094 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1297 backedges. 47 proven. 385 refuted. 0 times theorem prover too weak. 865 trivial. 0 not checked. [2023-12-19 23:43:16,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2062610878] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:16,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:16,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 15] total 26 [2023-12-19 23:43:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132186820] [2023-12-19 23:43:16,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:16,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-19 23:43:16,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-19 23:43:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=549, Unknown=0, NotChecked=0, Total=650 [2023-12-19 23:43:16,174 INFO L87 Difference]: Start difference. First operand 83 states and 115 transitions. Second operand has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-12-19 23:43:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:16,544 INFO L93 Difference]: Finished difference Result 213 states and 371 transitions. [2023-12-19 23:43:16,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-19 23:43:16,545 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) Word has length 216 [2023-12-19 23:43:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:16,546 INFO L225 Difference]: With dead ends: 213 [2023-12-19 23:43:16,546 INFO L226 Difference]: Without dead ends: 133 [2023-12-19 23:43:16,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 475 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=275, Invalid=1285, Unknown=0, NotChecked=0, Total=1560 [2023-12-19 23:43:16,547 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 84 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:16,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 314 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 23:43:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-19 23:43:16,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 113. [2023-12-19 23:43:16,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 77 states have internal predecessors, (92), 20 states have call successors, (20), 11 states have call predecessors, (20), 16 states have return successors, (56), 24 states have call predecessors, (56), 20 states have call successors, (56) [2023-12-19 23:43:16,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 168 transitions. [2023-12-19 23:43:16,554 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 168 transitions. Word has length 216 [2023-12-19 23:43:16,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:16,555 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 168 transitions. [2023-12-19 23:43:16,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 26 states have internal predecessors, (82), 20 states have call successors, (26), 1 states have call predecessors, (26), 10 states have return successors, (32), 12 states have call predecessors, (32), 20 states have call successors, (32) [2023-12-19 23:43:16,555 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 168 transitions. [2023-12-19 23:43:16,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-12-19 23:43:16,556 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:16,557 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 13, 13, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 5, 5, 4, 3, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:16,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:16,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:16,764 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:16,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:16,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1656224918, now seen corresponding path program 1 times [2023-12-19 23:43:16,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:16,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785346226] [2023-12-19 23:43:16,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:16,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 23:43:17,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:17,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-12-19 23:43:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:17,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 167 proven. 260 refuted. 0 times theorem prover too weak. 977 trivial. 0 not checked. [2023-12-19 23:43:17,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785346226] [2023-12-19 23:43:17,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785346226] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:17,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862711993] [2023-12-19 23:43:17,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:17,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:17,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:17,266 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:17,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 23:43:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:17,379 INFO L262 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-19 23:43:17,382 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:17,488 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 418 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2023-12-19 23:43:17,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:18,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 77 proven. 442 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2023-12-19 23:43:18,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862711993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:18,953 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:18,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 17] total 28 [2023-12-19 23:43:18,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531393653] [2023-12-19 23:43:18,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:18,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-19 23:43:18,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:18,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-19 23:43:18,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2023-12-19 23:43:18,956 INFO L87 Difference]: Start difference. First operand 113 states and 168 transitions. Second operand has 28 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-12-19 23:43:19,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:19,430 INFO L93 Difference]: Finished difference Result 259 states and 446 transitions. [2023-12-19 23:43:19,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-19 23:43:19,431 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) Word has length 227 [2023-12-19 23:43:19,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:19,434 INFO L225 Difference]: With dead ends: 259 [2023-12-19 23:43:19,434 INFO L226 Difference]: Without dead ends: 154 [2023-12-19 23:43:19,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 498 SyntacticMatches, 7 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=342, Invalid=1638, Unknown=0, NotChecked=0, Total=1980 [2023-12-19 23:43:19,435 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 88 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:19,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 339 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 23:43:19,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-19 23:43:19,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 144. [2023-12-19 23:43:19,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 100 states have (on average 1.24) internal successors, (124), 98 states have internal predecessors, (124), 26 states have call successors, (26), 18 states have call predecessors, (26), 17 states have return successors, (73), 27 states have call predecessors, (73), 26 states have call successors, (73) [2023-12-19 23:43:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 223 transitions. [2023-12-19 23:43:19,444 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 223 transitions. Word has length 227 [2023-12-19 23:43:19,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:19,444 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 223 transitions. [2023-12-19 23:43:19,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.4615384615384617) internal successors, (90), 28 states have internal predecessors, (90), 22 states have call successors, (28), 1 states have call predecessors, (28), 11 states have return successors, (37), 14 states have call predecessors, (37), 22 states have call successors, (37) [2023-12-19 23:43:19,445 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 223 transitions. [2023-12-19 23:43:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2023-12-19 23:43:19,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:19,450 INFO L195 NwaCegarLoop]: trace histogram [38, 38, 33, 33, 29, 28, 19, 19, 19, 19, 19, 19, 19, 16, 16, 16, 16, 16, 16, 16, 12, 10, 10, 4, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:19,458 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:19,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-19 23:43:19,656 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:19,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:19,657 INFO L85 PathProgramCache]: Analyzing trace with hash -14112611, now seen corresponding path program 2 times [2023-12-19 23:43:19,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:19,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038022385] [2023-12-19 23:43:19,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:19,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:20,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 23:43:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 23:43:20,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:20,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:20,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-19 23:43:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-19 23:43:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-12-19 23:43:20,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:20,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:20,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 265 proven. 869 refuted. 0 times theorem prover too weak. 5738 trivial. 0 not checked. [2023-12-19 23:43:20,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038022385] [2023-12-19 23:43:20,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038022385] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:20,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357977004] [2023-12-19 23:43:20,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 23:43:20,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:20,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:20,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:20,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-19 23:43:20,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 23:43:20,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:43:20,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-19 23:43:20,941 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 159 proven. 1240 refuted. 0 times theorem prover too weak. 5473 trivial. 0 not checked. [2023-12-19 23:43:21,064 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:23,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6872 backedges. 159 proven. 1273 refuted. 0 times theorem prover too weak. 5440 trivial. 0 not checked. [2023-12-19 23:43:23,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357977004] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:23,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:23,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 19] total 30 [2023-12-19 23:43:23,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998068247] [2023-12-19 23:43:23,351 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:23,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-12-19 23:43:23,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:23,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-12-19 23:43:23,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=736, Unknown=0, NotChecked=0, Total=870 [2023-12-19 23:43:23,352 INFO L87 Difference]: Start difference. First operand 144 states and 223 transitions. Second operand has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 30 states have internal predecessors, (96), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-12-19 23:43:23,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:23,886 INFO L93 Difference]: Finished difference Result 333 states and 593 transitions. [2023-12-19 23:43:23,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-12-19 23:43:23,887 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 30 states have internal predecessors, (96), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) Word has length 486 [2023-12-19 23:43:23,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:23,889 INFO L225 Difference]: With dead ends: 333 [2023-12-19 23:43:23,889 INFO L226 Difference]: Without dead ends: 196 [2023-12-19 23:43:23,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1146 GetRequests, 1090 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=406, Invalid=2044, Unknown=0, NotChecked=0, Total=2450 [2023-12-19 23:43:23,891 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 104 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:23,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 326 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 23:43:23,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-12-19 23:43:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 172. [2023-12-19 23:43:23,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 121 states have (on average 1.2148760330578512) internal successors, (147), 117 states have internal predecessors, (147), 32 states have call successors, (32), 24 states have call predecessors, (32), 18 states have return successors, (92), 30 states have call predecessors, (92), 32 states have call successors, (92) [2023-12-19 23:43:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 271 transitions. [2023-12-19 23:43:23,902 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 271 transitions. Word has length 486 [2023-12-19 23:43:23,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:23,903 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 271 transitions. [2023-12-19 23:43:23,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 28 states have (on average 3.4285714285714284) internal successors, (96), 30 states have internal predecessors, (96), 24 states have call successors, (30), 1 states have call predecessors, (30), 12 states have return successors, (40), 15 states have call predecessors, (40), 24 states have call successors, (40) [2023-12-19 23:43:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 271 transitions. [2023-12-19 23:43:23,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2023-12-19 23:43:23,909 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:23,909 INFO L195 NwaCegarLoop]: trace histogram [40, 40, 39, 39, 33, 31, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 14, 11, 8, 7, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:23,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:24,118 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:24,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -936310761, now seen corresponding path program 3 times [2023-12-19 23:43:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:24,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121001633] [2023-12-19 23:43:24,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:24,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:24,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:24,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:24,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:25,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-19 23:43:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-12-19 23:43:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:25,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:25,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-12-19 23:43:25,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:25,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:25,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:25,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:25,733 INFO L134 CoverageAnalysis]: Checked inductivity of 8521 backedges. 1454 proven. 1031 refuted. 0 times theorem prover too weak. 6036 trivial. 0 not checked. [2023-12-19 23:43:25,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:25,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121001633] [2023-12-19 23:43:25,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121001633] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:25,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397036159] [2023-12-19 23:43:25,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 23:43:25,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:25,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:25,736 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:25,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-19 23:43:25,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-19 23:43:25,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:43:25,896 INFO L262 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-19 23:43:25,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 8521 backedges. 1431 proven. 84 refuted. 0 times theorem prover too weak. 7006 trivial. 0 not checked. [2023-12-19 23:43:26,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 8521 backedges. 1431 proven. 89 refuted. 0 times theorem prover too weak. 7001 trivial. 0 not checked. [2023-12-19 23:43:27,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397036159] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:27,561 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:27,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 14, 17] total 41 [2023-12-19 23:43:27,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326271954] [2023-12-19 23:43:27,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:27,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-12-19 23:43:27,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:27,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-12-19 23:43:27,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=1395, Unknown=0, NotChecked=0, Total=1640 [2023-12-19 23:43:27,564 INFO L87 Difference]: Start difference. First operand 172 states and 271 transitions. Second operand has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 41 states have internal predecessors, (115), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-12-19 23:43:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:28,220 INFO L93 Difference]: Finished difference Result 390 states and 702 transitions. [2023-12-19 23:43:28,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-12-19 23:43:28,221 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 41 states have internal predecessors, (115), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) Word has length 541 [2023-12-19 23:43:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:28,223 INFO L225 Difference]: With dead ends: 390 [2023-12-19 23:43:28,223 INFO L226 Difference]: Without dead ends: 219 [2023-12-19 23:43:28,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1277 GetRequests, 1219 SyntacticMatches, 8 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=414, Invalid=2238, Unknown=0, NotChecked=0, Total=2652 [2023-12-19 23:43:28,225 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 75 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:28,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 750 Invalid, 1373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 23:43:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-19 23:43:28,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 215. [2023-12-19 23:43:28,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.051948051948052) internal successors, (162), 148 states have internal predecessors, (162), 42 states have call successors, (42), 35 states have call predecessors, (42), 18 states have return successors, (109), 31 states have call predecessors, (109), 42 states have call successors, (109) [2023-12-19 23:43:28,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 313 transitions. [2023-12-19 23:43:28,236 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 313 transitions. Word has length 541 [2023-12-19 23:43:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:28,236 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 313 transitions. [2023-12-19 23:43:28,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.8048780487804876) internal successors, (115), 41 states have internal predecessors, (115), 26 states have call successors, (38), 1 states have call predecessors, (38), 17 states have return successors, (49), 31 states have call predecessors, (49), 26 states have call successors, (49) [2023-12-19 23:43:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 313 transitions. [2023-12-19 23:43:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 977 [2023-12-19 23:43:28,242 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:28,243 INFO L195 NwaCegarLoop]: trace histogram [74, 74, 69, 69, 58, 57, 37, 37, 37, 37, 37, 37, 37, 34, 34, 34, 34, 34, 34, 34, 24, 20, 16, 12, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:28,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:28,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-19 23:43:28,447 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:28,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:28,448 INFO L85 PathProgramCache]: Analyzing trace with hash 990407125, now seen corresponding path program 4 times [2023-12-19 23:43:28,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:28,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075682878] [2023-12-19 23:43:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:28,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:29,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:30,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-19 23:43:30,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 486 [2023-12-19 23:43:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-12-19 23:43:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:30,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:30,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:30,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 691 proven. 2972 refuted. 0 times theorem prover too weak. 24682 trivial. 0 not checked. [2023-12-19 23:43:30,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075682878] [2023-12-19 23:43:30,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075682878] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:30,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542398796] [2023-12-19 23:43:30,890 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 23:43:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:30,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:30,891 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:30,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 23:43:31,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 23:43:31,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:43:31,252 INFO L262 TraceCheckSpWp]: Trace formula consists of 1736 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-19 23:43:31,269 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:31,429 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 11076 proven. 427 refuted. 0 times theorem prover too weak. 16842 trivial. 0 not checked. [2023-12-19 23:43:31,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 28345 backedges. 657 proven. 3645 refuted. 0 times theorem prover too weak. 24043 trivial. 0 not checked. [2023-12-19 23:43:34,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542398796] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:34,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 23] total 37 [2023-12-19 23:43:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926135135] [2023-12-19 23:43:34,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:34,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-12-19 23:43:34,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:34,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-12-19 23:43:34,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1131, Unknown=0, NotChecked=0, Total=1332 [2023-12-19 23:43:34,872 INFO L87 Difference]: Start difference. First operand 215 states and 313 transitions. Second operand has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 37 states have internal predecessors, (125), 31 states have call successors, (42), 2 states have call predecessors, (42), 13 states have return successors, (53), 19 states have call predecessors, (53), 31 states have call successors, (53) [2023-12-19 23:43:35,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:35,493 INFO L93 Difference]: Finished difference Result 437 states and 649 transitions. [2023-12-19 23:43:35,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-12-19 23:43:35,493 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 37 states have internal predecessors, (125), 31 states have call successors, (42), 2 states have call predecessors, (42), 13 states have return successors, (53), 19 states have call predecessors, (53), 31 states have call successors, (53) Word has length 976 [2023-12-19 23:43:35,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:35,495 INFO L225 Difference]: With dead ends: 437 [2023-12-19 23:43:35,495 INFO L226 Difference]: Without dead ends: 231 [2023-12-19 23:43:35,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2270 GetRequests, 2211 SyntacticMatches, 11 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=400, Invalid=2050, Unknown=0, NotChecked=0, Total=2450 [2023-12-19 23:43:35,497 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 89 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:35,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 538 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 23:43:35,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-19 23:43:35,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 213. [2023-12-19 23:43:35,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 153 states have (on average 1.0457516339869282) internal successors, (160), 147 states have internal predecessors, (160), 41 states have call successors, (41), 35 states have call predecessors, (41), 18 states have return successors, (104), 30 states have call predecessors, (104), 41 states have call successors, (104) [2023-12-19 23:43:35,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 305 transitions. [2023-12-19 23:43:35,507 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 305 transitions. Word has length 976 [2023-12-19 23:43:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:35,508 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 305 transitions. [2023-12-19 23:43:35,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.3783783783783785) internal successors, (125), 37 states have internal predecessors, (125), 31 states have call successors, (42), 2 states have call predecessors, (42), 13 states have return successors, (53), 19 states have call predecessors, (53), 31 states have call successors, (53) [2023-12-19 23:43:35,508 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 305 transitions. [2023-12-19 23:43:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1032 [2023-12-19 23:43:35,514 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:35,515 INFO L195 NwaCegarLoop]: trace histogram [77, 77, 74, 74, 61, 61, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 24, 23, 16, 13, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:35,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:35,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-19 23:43:35,721 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:35,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:35,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1871893841, now seen corresponding path program 5 times [2023-12-19 23:43:35,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:35,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726741437] [2023-12-19 23:43:35,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:35,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:35,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:36,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-19 23:43:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:37,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:37,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:37,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-19 23:43:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:38,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2023-12-19 23:43:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-12-19 23:43:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-12-19 23:43:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2023-12-19 23:43:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 23:43:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-12-19 23:43:38,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-12-19 23:43:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 23:43:38,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-12-19 23:43:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-12-19 23:43:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 23:43:38,931 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 1958 proven. 4071 refuted. 0 times theorem prover too weak. 25615 trivial. 0 not checked. [2023-12-19 23:43:38,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 23:43:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726741437] [2023-12-19 23:43:38,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726741437] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 23:43:38,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740413896] [2023-12-19 23:43:38,931 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-19 23:43:38,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 23:43:38,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 23:43:38,932 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 23:43:38,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 23:43:39,337 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 46 check-sat command(s) [2023-12-19 23:43:39,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 23:43:39,343 INFO L262 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-19 23:43:39,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 23:43:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 11850 proven. 901 refuted. 0 times theorem prover too weak. 18893 trivial. 0 not checked. [2023-12-19 23:43:39,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 23:43:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 31644 backedges. 3182 proven. 1720 refuted. 0 times theorem prover too weak. 26742 trivial. 0 not checked. [2023-12-19 23:43:43,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740413896] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 23:43:43,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 23:43:43,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 18, 25] total 58 [2023-12-19 23:43:43,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428651200] [2023-12-19 23:43:43,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 23:43:43,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-12-19 23:43:43,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 23:43:43,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-12-19 23:43:43,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=2898, Unknown=0, NotChecked=0, Total=3306 [2023-12-19 23:43:43,789 INFO L87 Difference]: Start difference. First operand 213 states and 305 transitions. Second operand has 58 states, 57 states have (on average 2.8771929824561404) internal successors, (164), 58 states have internal predecessors, (164), 41 states have call successors, (53), 2 states have call predecessors, (53), 25 states have return successors, (73), 42 states have call predecessors, (73), 41 states have call successors, (73) [2023-12-19 23:43:45,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 23:43:45,426 INFO L93 Difference]: Finished difference Result 542 states and 951 transitions. [2023-12-19 23:43:45,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2023-12-19 23:43:45,427 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 2.8771929824561404) internal successors, (164), 58 states have internal predecessors, (164), 41 states have call successors, (53), 2 states have call predecessors, (53), 25 states have return successors, (73), 42 states have call predecessors, (73), 41 states have call successors, (73) Word has length 1031 [2023-12-19 23:43:45,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 23:43:45,438 INFO L225 Difference]: With dead ends: 542 [2023-12-19 23:43:45,438 INFO L226 Difference]: Without dead ends: 322 [2023-12-19 23:43:45,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2442 GetRequests, 2326 SyntacticMatches, 12 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4365 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1333, Invalid=9797, Unknown=0, NotChecked=0, Total=11130 [2023-12-19 23:43:45,442 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 267 mSDsluCounter, 1333 mSDsCounter, 0 mSdLazyCounter, 2607 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1402 SdHoareTripleChecker+Invalid, 2818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 2607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-19 23:43:45,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1402 Invalid, 2818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 2607 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-19 23:43:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-12-19 23:43:45,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 235. [2023-12-19 23:43:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 167 states have (on average 1.035928143712575) internal successors, (173), 163 states have internal predecessors, (173), 47 states have call successors, (47), 38 states have call predecessors, (47), 20 states have return successors, (120), 33 states have call predecessors, (120), 47 states have call successors, (120) [2023-12-19 23:43:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 340 transitions. [2023-12-19 23:43:45,458 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 340 transitions. Word has length 1031 [2023-12-19 23:43:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 23:43:45,458 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 340 transitions. [2023-12-19 23:43:45,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 2.8771929824561404) internal successors, (164), 58 states have internal predecessors, (164), 41 states have call successors, (53), 2 states have call predecessors, (53), 25 states have return successors, (73), 42 states have call predecessors, (73), 41 states have call successors, (73) [2023-12-19 23:43:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 340 transitions. [2023-12-19 23:43:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1209 [2023-12-19 23:43:45,467 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 23:43:45,467 INFO L195 NwaCegarLoop]: trace histogram [89, 89, 88, 88, 72, 71, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 28, 27, 17, 17, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:45,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 23:43:45,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-19 23:43:45,675 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 23:43:45,675 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 23:43:45,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1265411898, now seen corresponding path program 6 times [2023-12-19 23:43:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 23:43:45,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205939664] [2023-12-19 23:43:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 23:43:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 23:43:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 23:43:45,824 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 23:43:46,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 23:43:46,089 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 23:43:46,090 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 23:43:46,090 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 23:43:46,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 23:43:46,094 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 23:43:46,098 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 23:43:46,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 11:43:46 BoogieIcfgContainer [2023-12-19 23:43:46,212 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 23:43:46,212 INFO L158 Benchmark]: Toolchain (without parser) took 38593.34ms. Allocated memory was 307.2MB in the beginning and 921.7MB in the end (delta: 614.5MB). Free memory was 255.9MB in the beginning and 783.4MB in the end (delta: -527.5MB). Peak memory consumption was 540.1MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,212 INFO L158 Benchmark]: CDTParser took 0.52ms. Allocated memory is still 201.3MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 23:43:46,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.82ms. Allocated memory is still 307.2MB. Free memory was 255.4MB in the beginning and 245.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.37ms. Allocated memory is still 307.2MB. Free memory was 245.0MB in the beginning and 243.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,213 INFO L158 Benchmark]: Boogie Preprocessor took 17.85ms. Allocated memory is still 307.2MB. Free memory was 243.4MB in the beginning and 241.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,213 INFO L158 Benchmark]: RCFGBuilder took 222.30ms. Allocated memory is still 307.2MB. Free memory was 241.9MB in the beginning and 231.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,214 INFO L158 Benchmark]: TraceAbstraction took 38161.41ms. Allocated memory was 307.2MB in the beginning and 921.7MB in the end (delta: 614.5MB). Free memory was 230.9MB in the beginning and 783.4MB in the end (delta: -552.5MB). Peak memory consumption was 514.9MB. Max. memory is 8.0GB. [2023-12-19 23:43:46,220 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.52ms. Allocated memory is still 201.3MB. Free memory is still 149.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.82ms. Allocated memory is still 307.2MB. Free memory was 255.4MB in the beginning and 245.0MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 18.37ms. Allocated memory is still 307.2MB. Free memory was 245.0MB in the beginning and 243.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 17.85ms. Allocated memory is still 307.2MB. Free memory was 243.4MB in the beginning and 241.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 222.30ms. Allocated memory is still 307.2MB. Free memory was 241.9MB in the beginning and 231.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 38161.41ms. Allocated memory was 307.2MB in the beginning and 921.7MB in the end (delta: 614.5MB). Free memory was 230.9MB in the beginning and 783.4MB in the end (delta: -552.5MB). Peak memory consumption was 514.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 41]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L38] int x = 10; VAL [x=10] [L39] CALL, EXPR fibo1(x) VAL [\old(n)=10] [L10] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L12] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=9] [L20] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L22] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=8] [L10] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L12] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L20] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L22] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=7, n=7] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=7, n=7] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=8, n=8] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=8, n=8] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=9, n=9] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=9, n=9] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=10, n=10] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=8] [L20] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L22] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=7] [L10] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L12] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=6] [L20] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L22] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L10] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L12] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=5, n=5] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=5, n=5] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=6, n=6] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=6, n=6] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=7, n=7] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=7, n=7] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=8, n=8] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=6] [L10] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L12] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L20] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L22] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L10] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L12] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L20] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L22] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=3, n=3] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=3, n=3] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=4, n=4] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=4, n=4] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=5, n=5] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=5, n=5] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=6, n=6] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L20] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L22] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L10] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L12] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L20] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L22] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L10] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L12] COND TRUE n == 1 [L13] return 1; VAL [\old(n)=1, \result=1, n=1] [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=2, n=2] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L10] COND TRUE n < 1 [L11] return 0; VAL [\old(n)=0, \result=0, n=0] [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=2, n=2] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=3, n=3] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=3, n=3] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-1) VAL [\old(n)=4, n=4] [L25] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L10] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L12] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L20] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L22] COND TRUE n == 1 [L23] return 1; VAL [\old(n)=1, \result=1, n=1] [L15] RET, EXPR fibo2(n-1) VAL [\old(n)=2, n=2] [L15] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L20] COND TRUE n < 1 [L21] return 0; VAL [\old(n)=0, \result=0, n=0] [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=2, n=2] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=4, n=4] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=6, n=6] [L15] return fibo2(n-1) + fibo2(n-2); [L25] RET, EXPR fibo1(n-2) VAL [\old(n)=8, n=8] [L25] return fibo1(n-1) + fibo1(n-2); [L15] RET, EXPR fibo2(n-2) VAL [\old(n)=10, n=10] [L15] return fibo2(n-1) + fibo2(n-2); [L39] RET, EXPR fibo1(x) VAL [x=10] [L39] int result = fibo1(x); [L40] COND TRUE result == 55 VAL [result=55, x=10] [L41] reach_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 15, TraceHistogramMax: 89, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1059 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1001 mSDsluCounter, 4999 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4547 mSDsCounter, 875 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8385 IncrementalHoareTripleChecker+Invalid, 9260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 875 mSolverCounterUnsat, 452 mSDtfsCounter, 8385 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 8874 GetRequests, 8333 SyntacticMatches, 71 SemanticMatches, 470 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8463 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=235occurred in iteration=14, InterpolantAutomatonStates: 337, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 252 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 26.9s InterpolantComputationTime, 8669 NumberOfCodeBlocks, 7909 NumberOfCodeBlocksAsserted, 83 NumberOfCheckSat, 11144 ConstructedInterpolants, 0 QuantifiedInterpolants, 15158 SizeOfPredicates, 68 NumberOfNonLiveVariables, 6686 ConjunctsInSsa, 160 ConjunctsInUnsatCore, 38 InterpolantComputations, 2 PerfectInterpolantSequences, 214167/234924 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 proved your program to be incorrect! [2023-12-19 23:43:46,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...