/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:10:13,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:10:13,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:10:13,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:10:13,484 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:10:13,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:10:13,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:10:13,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:10:13,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:10:13,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:10:13,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:10:13,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:10:13,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:10:13,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:10:13,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:10:13,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:10:13,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:10:13,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:10:13,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:10:13,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:10:13,521 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:10:13,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:10:13,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:10:13,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:10:13,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:10:13,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:10:13,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:10:13,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:10:13,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:10:13,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:10:13,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:10:13,536 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:10:13,537 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:10:13,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:10:13,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:10:13,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:10:13,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:10:13,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:10:13,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:10:13,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:10:13,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:10:13,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-10-15 17:10:13,607 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:10:13,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:10:13,610 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:10:13,610 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:10:13,611 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:10:13,611 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:10:13,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:10:13,613 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:10:13,614 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:10:13,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:10:13,614 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:10:13,614 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:10:13,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:10:13,616 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:10:13,616 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:10:13,617 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:10:13,617 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:10:13,617 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:10:13,617 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:10:13,617 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:10:13,618 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:10:13,618 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:10:13,618 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:10:13,618 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:10:13,618 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:10:13,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:10:13,619 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:10:13,619 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:10:13,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:10:13,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:10:13,621 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-10-15 17:10:14,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:10:14,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:10:14,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:10:14,045 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:10:14,046 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:10:14,048 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-15 17:10:14,143 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f281b624e/fa62cd00447346a2b297e3d2338cfe6e/FLAG1e01ffb16 [2022-10-15 17:10:14,828 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:10:14,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2022-10-15 17:10:14,834 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f281b624e/fa62cd00447346a2b297e3d2338cfe6e/FLAG1e01ffb16 [2022-10-15 17:10:15,206 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f281b624e/fa62cd00447346a2b297e3d2338cfe6e [2022-10-15 17:10:15,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:10:15,215 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:10:15,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:10:15,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:10:15,225 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:10:15,226 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39fa533f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15, skipping insertion in model container [2022-10-15 17:10:15,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:10:15,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:10:15,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-15 17:10:15,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:10:15,429 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:10:15,448 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2022-10-15 17:10:15,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:10:15,467 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:10:15,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15 WrapperNode [2022-10-15 17:10:15,468 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:10:15,469 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:10:15,469 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:10:15,469 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:10:15,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,488 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,511 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2022-10-15 17:10:15,512 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:10:15,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:10:15,513 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:10:15,513 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:10:15,525 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,525 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,527 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,533 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,534 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:10:15,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:10:15,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:10:15,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:10:15,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (1/1) ... [2022-10-15 17:10:15,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:10:15,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:15,580 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-10-15 17:10:15,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-10-15 17:10:15,662 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-10-15 17:10:15,662 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-10-15 17:10:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:10:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:10:15,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:10:15,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:10:15,752 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:10:15,755 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:10:15,994 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:10:16,004 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:10:16,005 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 17:10:16,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:10:16 BoogieIcfgContainer [2022-10-15 17:10:16,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:10:16,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:10:16,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:10:16,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:10:16,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:10:15" (1/3) ... [2022-10-15 17:10:16,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38659822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:10:16, skipping insertion in model container [2022-10-15 17:10:16,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:10:15" (2/3) ... [2022-10-15 17:10:16,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38659822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:10:16, skipping insertion in model container [2022-10-15 17:10:16,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:10:16" (3/3) ... [2022-10-15 17:10:16,026 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2022-10-15 17:10:16,050 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:10:16,050 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:10:16,139 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:10:16,156 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@a76d28e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:10:16,156 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:10:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 17:10:16,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:10:16,207 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:16,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:16,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:16,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:16,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1860129791, now seen corresponding path program 1 times [2022-10-15 17:10:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:16,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102791964] [2022-10-15 17:10:16,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:16,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:16,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:16,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:10:16,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:16,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102791964] [2022-10-15 17:10:16,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102791964] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:10:16,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:10:16,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:10:16,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578899320] [2022-10-15 17:10:16,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:10:16,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:10:16,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:16,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:10:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:10:16,589 INFO L87 Difference]: Start difference. First operand has 20 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-10-15 17:10:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:16,621 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2022-10-15 17:10:16,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:10:16,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 [2022-10-15 17:10:16,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:16,633 INFO L225 Difference]: With dead ends: 19 [2022-10-15 17:10:16,633 INFO L226 Difference]: Without dead ends: 16 [2022-10-15 17:10:16,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:10:16,641 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:16,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:10:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-10-15 17:10:16,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-10-15 17:10:16,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-10-15 17:10:16,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-10-15 17:10:16,693 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 10 [2022-10-15 17:10:16,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:16,695 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-10-15 17:10:16,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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) [2022-10-15 17:10:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-10-15 17:10:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:10:16,698 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:16,699 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:16,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:10:16,700 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:16,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:16,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1860129850, now seen corresponding path program 1 times [2022-10-15 17:10:16,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:16,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777483774] [2022-10-15 17:10:16,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:16,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:16,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:16,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:10:16,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:16,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777483774] [2022-10-15 17:10:16,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777483774] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:10:16,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:10:16,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:10:16,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638484544] [2022-10-15 17:10:16,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:10:16,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:10:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:10:16,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:10:16,882 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2022-10-15 17:10:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:16,949 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-10-15 17:10:16,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:10:16,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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 [2022-10-15 17:10:16,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:16,953 INFO L225 Difference]: With dead ends: 20 [2022-10-15 17:10:16,953 INFO L226 Difference]: Without dead ends: 18 [2022-10-15 17:10:16,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:10:16,956 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 8 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:16,957 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:10:16,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-15 17:10:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-15 17:10:16,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 17:10:16,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-15 17:10:16,965 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2022-10-15 17:10:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:16,966 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-15 17:10:16,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 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) [2022-10-15 17:10:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-15 17:10:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:10:16,968 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:16,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:16,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:10:16,969 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:16,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:16,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1770497606, now seen corresponding path program 1 times [2022-10-15 17:10:16,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:16,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540434068] [2022-10-15 17:10:16,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:16,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-15 17:10:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540434068] [2022-10-15 17:10:17,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540434068] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:10:17,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:10:17,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:10:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966587258] [2022-10-15 17:10:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:10:17,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:10:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:17,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:10:17,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:10:17,084 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-10-15 17:10:17,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:17,132 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-10-15 17:10:17,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:10:17,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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 11 [2022-10-15 17:10:17,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:17,134 INFO L225 Difference]: With dead ends: 22 [2022-10-15 17:10:17,134 INFO L226 Difference]: Without dead ends: 20 [2022-10-15 17:10:17,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-15 17:10:17,137 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:17,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:10:17,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-15 17:10:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-10-15 17:10:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-10-15 17:10:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-15 17:10:17,145 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-10-15 17:10:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:17,146 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-15 17:10:17,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 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) [2022-10-15 17:10:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-15 17:10:17,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:10:17,148 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:17,148 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:17,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:10:17,149 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:17,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:17,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1065083249, now seen corresponding path program 1 times [2022-10-15 17:10:17,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:17,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154896783] [2022-10-15 17:10:17,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:17,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:17,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 17:10:17,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 17:10:17,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:17,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154896783] [2022-10-15 17:10:17,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154896783] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:10:17,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915592692] [2022-10-15 17:10:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:17,506 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) [2022-10-15 17:10:17,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-15 17:10:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:17,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:10:17,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:10:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-10-15 17:10:17,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:10:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 17:10:18,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915592692] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:10:18,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:10:18,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2022-10-15 17:10:18,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587070547] [2022-10-15 17:10:18,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:10:18,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-10-15 17:10:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-10-15 17:10:18,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2022-10-15 17:10:18,015 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 17:10:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:18,261 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2022-10-15 17:10:18,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-10-15 17:10:18,262 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2022-10-15 17:10:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:18,270 INFO L225 Difference]: With dead ends: 31 [2022-10-15 17:10:18,270 INFO L226 Difference]: Without dead ends: 29 [2022-10-15 17:10:18,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:10:18,282 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:18,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 58 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:10:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-10-15 17:10:18,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-10-15 17:10:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-10-15 17:10:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-10-15 17:10:18,303 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2022-10-15 17:10:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:18,305 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-10-15 17:10:18,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2022-10-15 17:10:18,306 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-10-15 17:10:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-10-15 17:10:18,313 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:18,313 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:18,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-10-15 17:10:18,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:18,530 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:18,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2004578544, now seen corresponding path program 1 times [2022-10-15 17:10:18,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:18,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69971002] [2022-10-15 17:10:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:18,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:18,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:18,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:18,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:19,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:19,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,155 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-10-15 17:10:19,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69971002] [2022-10-15 17:10:19,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69971002] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:10:19,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393444035] [2022-10-15 17:10:19,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:19,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:19,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:19,158 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) [2022-10-15 17:10:19,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-15 17:10:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:19,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:10:19,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:10:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-10-15 17:10:19,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:10:19,730 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-10-15 17:10:19,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393444035] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:10:19,730 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:10:19,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2022-10-15 17:10:19,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177919092] [2022-10-15 17:10:19,731 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:10:19,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-10-15 17:10:19,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:19,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-10-15 17:10:19,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-10-15 17:10:19,734 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-10-15 17:10:20,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:20,040 INFO L93 Difference]: Finished difference Result 47 states and 70 transitions. [2022-10-15 17:10:20,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:10:20,041 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2022-10-15 17:10:20,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:20,045 INFO L225 Difference]: With dead ends: 47 [2022-10-15 17:10:20,045 INFO L226 Difference]: Without dead ends: 44 [2022-10-15 17:10:20,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2022-10-15 17:10:20,047 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:20,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 89 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:10:20,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-10-15 17:10:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-10-15 17:10:20,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2022-10-15 17:10:20,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2022-10-15 17:10:20,062 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2022-10-15 17:10:20,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:20,062 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2022-10-15 17:10:20,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2022-10-15 17:10:20,063 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2022-10-15 17:10:20,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-10-15 17:10:20,066 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:20,066 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:20,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-15 17:10:20,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:20,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:20,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:20,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1761516262, now seen corresponding path program 2 times [2022-10-15 17:10:20,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:20,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583519549] [2022-10-15 17:10:20,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:20,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:20,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:20,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:20,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:21,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 17:10:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-10-15 17:10:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 17:10:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-10-15 17:10:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:21,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2022-10-15 17:10:21,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583519549] [2022-10-15 17:10:21,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583519549] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:10:21,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116159531] [2022-10-15 17:10:21,362 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:10:21,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:21,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:21,363 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) [2022-10-15 17:10:21,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-15 17:10:21,474 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:10:21,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:10:21,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 17:10:21,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:10:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2022-10-15 17:10:21,622 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:10:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2022-10-15 17:10:22,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116159531] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:10:22,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:10:22,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2022-10-15 17:10:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334679259] [2022-10-15 17:10:22,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:10:22,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-10-15 17:10:22,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:22,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-10-15 17:10:22,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2022-10-15 17:10:22,669 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-10-15 17:10:23,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:23,286 INFO L93 Difference]: Finished difference Result 78 states and 122 transitions. [2022-10-15 17:10:23,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-10-15 17:10:23,287 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2022-10-15 17:10:23,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:23,290 INFO L225 Difference]: With dead ends: 78 [2022-10-15 17:10:23,290 INFO L226 Difference]: Without dead ends: 76 [2022-10-15 17:10:23,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2022-10-15 17:10:23,292 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 93 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:23,293 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 120 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:10:23,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-10-15 17:10:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2022-10-15 17:10:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2022-10-15 17:10:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2022-10-15 17:10:23,308 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2022-10-15 17:10:23,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:23,308 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2022-10-15 17:10:23,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2022-10-15 17:10:23,309 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2022-10-15 17:10:23,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-10-15 17:10:23,317 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:23,317 INFO L195 NwaCegarLoop]: trace histogram [63, 63, 51, 31, 31, 31, 31, 31, 31, 31, 20, 12, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:23,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-15 17:10:23,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:23,532 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:23,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:23,533 INFO L85 PathProgramCache]: Analyzing trace with hash -848170153, now seen corresponding path program 3 times [2022-10-15 17:10:23,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:23,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019849960] [2022-10-15 17:10:23,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:23,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:24,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:25,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:25,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:25,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:10:25,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:25,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:26,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:26,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-10-15 17:10:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:10:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:26,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:26,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:26,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:26,417 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 607 proven. 2207 refuted. 0 times theorem prover too weak. 8133 trivial. 0 not checked. [2022-10-15 17:10:26,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:26,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019849960] [2022-10-15 17:10:26,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019849960] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:10:26,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868541258] [2022-10-15 17:10:26,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:10:26,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:26,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:26,419 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) [2022-10-15 17:10:26,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-15 17:10:26,603 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2022-10-15 17:10:26,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:10:26,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 16 conjunts are in the unsatisfiable core [2022-10-15 17:10:26,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:10:26,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 265 proven. 1906 refuted. 0 times theorem prover too weak. 8776 trivial. 0 not checked. [2022-10-15 17:10:26,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:10:29,048 INFO L134 CoverageAnalysis]: Checked inductivity of 10947 backedges. 265 proven. 1963 refuted. 0 times theorem prover too weak. 8719 trivial. 0 not checked. [2022-10-15 17:10:29,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868541258] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:10:29,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:10:29,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 11, 17] total 30 [2022-10-15 17:10:29,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46239638] [2022-10-15 17:10:29,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:10:29,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-10-15 17:10:29,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:29,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-10-15 17:10:29,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:10:29,053 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 23 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (40), 20 states have call predecessors, (40), 23 states have call successors, (40) [2022-10-15 17:10:29,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:29,619 INFO L93 Difference]: Finished difference Result 100 states and 151 transitions. [2022-10-15 17:10:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-10-15 17:10:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 23 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (40), 20 states have call predecessors, (40), 23 states have call successors, (40) Word has length 433 [2022-10-15 17:10:29,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:29,624 INFO L225 Difference]: With dead ends: 100 [2022-10-15 17:10:29,624 INFO L226 Difference]: Without dead ends: 100 [2022-10-15 17:10:29,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1027 GetRequests, 975 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=576, Invalid=1494, Unknown=0, NotChecked=0, Total=2070 [2022-10-15 17:10:29,627 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 147 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:29,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 151 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-15 17:10:29,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-10-15 17:10:29,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 82. [2022-10-15 17:10:29,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.1578947368421053) internal successors, (66), 56 states have internal predecessors, (66), 15 states have call successors, (15), 10 states have call predecessors, (15), 9 states have return successors, (37), 15 states have call predecessors, (37), 15 states have call successors, (37) [2022-10-15 17:10:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2022-10-15 17:10:29,642 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 433 [2022-10-15 17:10:29,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:29,643 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2022-10-15 17:10:29,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.6666666666666665) internal successors, (80), 30 states have internal predecessors, (80), 23 states have call successors, (27), 1 states have call predecessors, (27), 12 states have return successors, (40), 20 states have call predecessors, (40), 23 states have call successors, (40) [2022-10-15 17:10:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2022-10-15 17:10:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2022-10-15 17:10:29,657 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:29,658 INFO L195 NwaCegarLoop]: trace histogram [79, 79, 64, 39, 39, 39, 39, 39, 39, 39, 25, 15, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:29,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-15 17:10:29,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:29,872 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:29,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1890711729, now seen corresponding path program 4 times [2022-10-15 17:10:29,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:29,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567854762] [2022-10-15 17:10:29,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:29,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:10:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:32,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:32,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:32,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:32,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:10:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-15 17:10:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:33,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-10-15 17:10:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:10:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:10:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:34,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:34,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:34,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-10-15 17:10:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:10:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:10:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-10-15 17:10:34,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:10:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:10:34,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:10:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 2979 proven. 2940 refuted. 0 times theorem prover too weak. 11385 trivial. 0 not checked. [2022-10-15 17:10:34,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:10:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567854762] [2022-10-15 17:10:34,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567854762] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:10:34,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068994785] [2022-10-15 17:10:34,272 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 17:10:34,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:34,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:10:34,274 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) [2022-10-15 17:10:34,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-15 17:10:34,484 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 17:10:34,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:10:34,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 30 conjunts are in the unsatisfiable core [2022-10-15 17:10:34,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:10:34,762 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 1949 proven. 3503 refuted. 0 times theorem prover too weak. 11852 trivial. 0 not checked. [2022-10-15 17:10:34,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:10:39,673 INFO L134 CoverageAnalysis]: Checked inductivity of 17304 backedges. 1949 proven. 3611 refuted. 0 times theorem prover too weak. 11744 trivial. 0 not checked. [2022-10-15 17:10:39,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068994785] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:10:39,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:10:39,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 19, 31] total 47 [2022-10-15 17:10:39,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481579912] [2022-10-15 17:10:39,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:10:39,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-10-15 17:10:39,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:10:39,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-10-15 17:10:39,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1675, Unknown=0, NotChecked=0, Total=2162 [2022-10-15 17:10:39,680 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 42 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (70), 28 states have call predecessors, (70), 42 states have call successors, (70) [2022-10-15 17:10:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:10:40,755 INFO L93 Difference]: Finished difference Result 124 states and 176 transitions. [2022-10-15 17:10:40,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-10-15 17:10:40,756 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 42 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (70), 28 states have call predecessors, (70), 42 states have call successors, (70) Word has length 542 [2022-10-15 17:10:40,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:10:40,769 INFO L225 Difference]: With dead ends: 124 [2022-10-15 17:10:40,769 INFO L226 Difference]: Without dead ends: 124 [2022-10-15 17:10:40,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1302 GetRequests, 1216 SyntacticMatches, 15 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1258, Invalid=3998, Unknown=0, NotChecked=0, Total=5256 [2022-10-15 17:10:40,773 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 349 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 672 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 672 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-10-15 17:10:40,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 252 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 672 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-10-15 17:10:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-10-15 17:10:40,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 109. [2022-10-15 17:10:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2022-10-15 17:10:40,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2022-10-15 17:10:40,802 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 542 [2022-10-15 17:10:40,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:10:40,803 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2022-10-15 17:10:40,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.6382978723404253) internal successors, (124), 47 states have internal predecessors, (124), 42 states have call successors, (46), 1 states have call predecessors, (46), 16 states have return successors, (70), 28 states have call predecessors, (70), 42 states have call successors, (70) [2022-10-15 17:10:40,804 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2022-10-15 17:10:40,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2022-10-15 17:10:40,815 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:10:40,815 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:10:40,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-15 17:10:41,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:10:41,031 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:10:41,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:10:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash 906311151, now seen corresponding path program 5 times [2022-10-15 17:10:41,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:10:41,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236375109] [2022-10-15 17:10:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:10:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:10:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:10:41,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:10:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:10:41,301 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:10:41,301 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:10:41,303 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:10:41,305 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:10:41,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-10-15 17:10:41,310 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2022-10-15 17:10:41,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:10:41,456 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:10:41 BoogieIcfgContainer [2022-10-15 17:10:41,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:10:41,457 INFO L158 Benchmark]: Toolchain (without parser) took 26246.33ms. Allocated memory was 154.1MB in the beginning and 388.0MB in the end (delta: 233.8MB). Free memory was 128.8MB in the beginning and 288.3MB in the end (delta: -159.6MB). Peak memory consumption was 75.8MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,457 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 154.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:10:41,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.54ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 118.9MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,458 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.01ms. Allocated memory is still 154.1MB. Free memory was 118.8MB in the beginning and 117.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,458 INFO L158 Benchmark]: Boogie Preprocessor took 24.48ms. Allocated memory is still 154.1MB. Free memory was 117.4MB in the beginning and 116.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,459 INFO L158 Benchmark]: RCFGBuilder took 470.00ms. Allocated memory is still 154.1MB. Free memory was 116.4MB in the beginning and 107.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,459 INFO L158 Benchmark]: TraceAbstraction took 25443.35ms. Allocated memory was 154.1MB in the beginning and 388.0MB in the end (delta: 233.8MB). Free memory was 106.4MB in the beginning and 288.3MB in the end (delta: -182.0MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2022-10-15 17:10:41,464 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 154.1MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.54ms. Allocated memory is still 154.1MB. Free memory was 128.6MB in the beginning and 118.9MB in the end (delta: 9.6MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.01ms. Allocated memory is still 154.1MB. Free memory was 118.8MB in the beginning and 117.4MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.48ms. Allocated memory is still 154.1MB. Free memory was 117.4MB in the beginning and 116.4MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 470.00ms. Allocated memory is still 154.1MB. Free memory was 116.4MB in the beginning and 107.0MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 25443.35ms. Allocated memory was 154.1MB in the beginning and 388.0MB in the end (delta: 233.8MB). Free memory was 106.4MB in the beginning and 288.3MB in the end (delta: -182.0MB). Peak memory consumption was 52.7MB. 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 - UnprovableResult [Line: 33]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 33. Possible FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - UnprovableResult [Line: 27]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 9, TraceHistogramMax: 79, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 767 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 614 mSDsCounter, 1246 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1643 IncrementalHoareTripleChecker+Invalid, 2889 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1246 mSolverCounterUnsat, 153 mSDtfsCounter, 1643 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3007 GetRequests, 2771 SyntacticMatches, 30 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=8, InterpolantAutomatonStates: 141, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 19.1s InterpolantComputationTime, 2959 NumberOfCodeBlocks, 2667 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3715 ConstructedInterpolants, 0 QuantifiedInterpolants, 5727 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2131 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 72478/90156 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-10-15 17:10:41,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...