/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-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-15 17:12:12,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-15 17:12:12,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-15 17:12:12,908 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-15 17:12:12,909 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-15 17:12:12,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-15 17:12:12,919 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-15 17:12:12,940 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-15 17:12:12,944 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-15 17:12:12,952 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-15 17:12:12,953 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-15 17:12:12,957 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-15 17:12:12,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-15 17:12:12,960 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-15 17:12:12,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-15 17:12:12,970 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-15 17:12:12,971 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-15 17:12:12,972 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-15 17:12:12,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-15 17:12:12,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-15 17:12:12,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-15 17:12:12,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-15 17:12:12,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-15 17:12:12,996 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-15 17:12:13,005 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-15 17:12:13,006 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-15 17:12:13,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-15 17:12:13,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-15 17:12:13,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-15 17:12:13,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-15 17:12:13,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-15 17:12:13,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-15 17:12:13,014 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-15 17:12:13,015 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-15 17:12:13,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-15 17:12:13,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-15 17:12:13,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-15 17:12:13,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-15 17:12:13,019 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-15 17:12:13,020 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-15 17:12:13,021 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-15 17:12:13,022 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:12:13,075 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-15 17:12:13,076 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-15 17:12:13,077 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-15 17:12:13,077 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-15 17:12:13,079 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-15 17:12:13,079 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-15 17:12:13,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-15 17:12:13,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-15 17:12:13,082 INFO L138 SettingsManager]: * Use SBE=true [2022-10-15 17:12:13,083 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-15 17:12:13,084 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-15 17:12:13,084 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-15 17:12:13,085 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-15 17:12:13,085 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-15 17:12:13,085 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-15 17:12:13,085 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-10-15 17:12:13,086 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-10-15 17:12:13,086 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-10-15 17:12:13,086 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-15 17:12:13,086 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-10-15 17:12:13,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-15 17:12:13,087 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-15 17:12:13,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-15 17:12:13,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-15 17:12:13,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-15 17:12:13,088 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:13,088 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-15 17:12:13,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-15 17:12:13,088 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-15 17:12:13,089 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-15 17:12:13,089 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:12:13,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-15 17:12:13,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-15 17:12:13,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-15 17:12:13,516 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-15 17:12:13,517 INFO L275 PluginConnector]: CDTParser initialized [2022-10-15 17:12:13,519 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2022-10-15 17:12:13,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a4c170d/55ea71ba433e463394d9ebd3956c47c9/FLAG51ee49a66 [2022-10-15 17:12:14,292 INFO L306 CDTParser]: Found 1 translation units. [2022-10-15 17:12:14,293 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2022-10-15 17:12:14,301 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a4c170d/55ea71ba433e463394d9ebd3956c47c9/FLAG51ee49a66 [2022-10-15 17:12:14,666 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/87a4c170d/55ea71ba433e463394d9ebd3956c47c9 [2022-10-15 17:12:14,671 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-15 17:12:14,677 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-15 17:12:14,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:14,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-15 17:12:14,684 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-15 17:12:14,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@db2c7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14, skipping insertion in model container [2022-10-15 17:12:14,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,696 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-15 17:12:14,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-15 17:12:14,890 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-simple/fibo_7-2.c[741,754] [2022-10-15 17:12:14,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:14,906 INFO L203 MainTranslator]: Completed pre-run [2022-10-15 17:12:14,923 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-simple/fibo_7-2.c[741,754] [2022-10-15 17:12:14,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-15 17:12:14,940 INFO L208 MainTranslator]: Completed translation [2022-10-15 17:12:14,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14 WrapperNode [2022-10-15 17:12:14,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-15 17:12:14,942 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:14,942 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-15 17:12:14,942 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-15 17:12:14,951 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:12:14" (1/1) ... [2022-10-15 17:12:14,960 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:12:14" (1/1) ... [2022-10-15 17:12:14,979 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-10-15 17:12:14,980 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-15 17:12:14,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-15 17:12:14,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-15 17:12:14,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-15 17:12:14,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,993 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:14,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:15,000 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:15,001 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:15,003 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-15 17:12:15,004 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-15 17:12:15,004 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-15 17:12:15,004 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-15 17:12:15,005 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (1/1) ... [2022-10-15 17:12:15,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-15 17:12:15,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:15,040 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:12:15,048 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:12:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-15 17:12:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-15 17:12:15,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-15 17:12:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-15 17:12:15,103 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2022-10-15 17:12:15,104 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2022-10-15 17:12:15,198 INFO L235 CfgBuilder]: Building ICFG [2022-10-15 17:12:15,201 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-15 17:12:15,425 INFO L276 CfgBuilder]: Performing block encoding [2022-10-15 17:12:15,434 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-15 17:12:15,435 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-15 17:12:15,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:15 BoogieIcfgContainer [2022-10-15 17:12:15,437 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-15 17:12:15,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-15 17:12:15,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-15 17:12:15,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-15 17:12:15,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 05:12:14" (1/3) ... [2022-10-15 17:12:15,447 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d516493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:15, skipping insertion in model container [2022-10-15 17:12:15,447 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 05:12:14" (2/3) ... [2022-10-15 17:12:15,448 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d516493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 05:12:15, skipping insertion in model container [2022-10-15 17:12:15,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 05:12:15" (3/3) ... [2022-10-15 17:12:15,450 INFO L112 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2022-10-15 17:12:15,474 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-15 17:12:15,474 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-10-15 17:12:15,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-15 17:12:15,544 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;@7cb02599, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-15 17:12:15,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-10-15 17:12:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 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:12:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-10-15 17:12:15,608 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:15,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:15,610 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:15,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:15,639 INFO L85 PathProgramCache]: Analyzing trace with hash 904384931, now seen corresponding path program 1 times [2022-10-15 17:12:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:15,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318343499] [2022-10-15 17:12:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:15,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:16,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,196 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:12:16,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:16,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318343499] [2022-10-15 17:12:16,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318343499] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:12:16,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:12:16,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:12:16,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803921292] [2022-10-15 17:12:16,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:12:16,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:12:16,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:16,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:12:16,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:16,258 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 16 states have internal predecessors, (19), 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 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:12:16,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:16,320 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-10-15 17:12:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:12:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-10-15 17:12:16,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:16,342 INFO L225 Difference]: With dead ends: 30 [2022-10-15 17:12:16,342 INFO L226 Difference]: Without dead ends: 26 [2022-10-15 17:12:16,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:16,352 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 5 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:16,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 79 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:16,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-10-15 17:12:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2022-10-15 17:12:16,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:12:16,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-10-15 17:12:16,401 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 10 [2022-10-15 17:12:16,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:16,402 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-10-15 17:12:16,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-15 17:12:16,403 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-10-15 17:12:16,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:12:16,405 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:16,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-15 17:12:16,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:16,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:16,407 INFO L85 PathProgramCache]: Analyzing trace with hash -2028833235, now seen corresponding path program 1 times [2022-10-15 17:12:16,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:16,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683809984] [2022-10-15 17:12:16,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:16,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,461 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:12:16,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:16,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683809984] [2022-10-15 17:12:16,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683809984] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:12:16,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:12:16,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-10-15 17:12:16,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189021482] [2022-10-15 17:12:16,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:12:16,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-15 17:12:16,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-15 17:12:16,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-10-15 17:12:16,468 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:12:16,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:16,476 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-10-15 17:12:16,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-15 17:12:16,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:12:16,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:16,478 INFO L225 Difference]: With dead ends: 22 [2022-10-15 17:12:16,479 INFO L226 Difference]: Without dead ends: 18 [2022-10-15 17:12:16,479 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:12:16,481 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:16,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-10-15 17:12:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-10-15 17:12:16,488 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:12:16,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-15 17:12:16,490 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-10-15 17:12:16,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:16,490 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-15 17:12:16,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:12:16,491 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-15 17:12:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-10-15 17:12:16,492 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:16,492 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:16,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-15 17:12:16,493 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:16,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1314065684, now seen corresponding path program 1 times [2022-10-15 17:12:16,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:16,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544378310] [2022-10-15 17:12:16,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:16,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,645 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:12:16,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:16,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544378310] [2022-10-15 17:12:16,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544378310] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-15 17:12:16,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-15 17:12:16,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-15 17:12:16,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990566456] [2022-10-15 17:12:16,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-15 17:12:16,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-15 17:12:16,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:16,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-15 17:12:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:16,649 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), 4 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:12:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:16,687 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2022-10-15 17:12:16,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-15 17:12:16,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:12:16,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:16,692 INFO L225 Difference]: With dead ends: 22 [2022-10-15 17:12:16,693 INFO L226 Difference]: Without dead ends: 20 [2022-10-15 17:12:16,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-10-15 17:12:16,697 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:16,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-15 17:12:16,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-15 17:12:16,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-10-15 17:12:16,711 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:12:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-10-15 17:12:16,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-10-15 17:12:16,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:16,715 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-10-15 17:12:16,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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:12:16,715 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-10-15 17:12:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-10-15 17:12:16,717 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:16,717 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:12:16,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-15 17:12:16,717 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1542136281, now seen corresponding path program 1 times [2022-10-15 17:12:16,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:16,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031420528] [2022-10-15 17:12:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:16,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:16,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:16,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-15 17:12:16,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:16,991 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:12:16,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031420528] [2022-10-15 17:12:16,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031420528] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:16,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462893659] [2022-10-15 17:12:16,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:16,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:16,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:17,006 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:12:17,027 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:12:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:17,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:12:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:17,220 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:12:17,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:17,495 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:12:17,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462893659] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:17,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:17,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-10-15 17:12:17,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268969826] [2022-10-15 17:12:17,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:17,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-10-15 17:12:17,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:17,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-10-15 17:12:17,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:12:17,500 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:12:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:17,659 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-10-15 17:12:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-15 17:12:17,661 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) Word has length 23 [2022-10-15 17:12:17,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:17,664 INFO L225 Difference]: With dead ends: 20 [2022-10-15 17:12:17,665 INFO L226 Difference]: Without dead ends: 20 [2022-10-15 17:12:17,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-10-15 17:12:17,673 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:17,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 47 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:17,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-10-15 17:12:17,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-10-15 17:12:17,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-10-15 17:12:17,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-10-15 17:12:17,684 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2022-10-15 17:12:17,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:17,685 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-10-15 17:12:17,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 12 states have internal predecessors, (30), 8 states have call successors, (8), 1 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 8 states have call successors, (8) [2022-10-15 17:12:17,686 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-10-15 17:12:17,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-10-15 17:12:17,687 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:17,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:17,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-15 17:12:17,901 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:12:17,902 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:17,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash 928132326, now seen corresponding path program 1 times [2022-10-15 17:12:17,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:17,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249666667] [2022-10-15 17:12:17,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:17,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:17,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:12:18,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:18,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249666667] [2022-10-15 17:12:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249666667] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961706022] [2022-10-15 17:12:18,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:18,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:18,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:18,181 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:12:18,190 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:12:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjunts are in the unsatisfiable core [2022-10-15 17:12:18,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:18,325 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-15 17:12:18,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:18,532 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-10-15 17:12:18,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961706022] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:18,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:18,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2022-10-15 17:12:18,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073069484] [2022-10-15 17:12:18,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:18,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-10-15 17:12:18,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:18,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-10-15 17:12:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-10-15 17:12:18,538 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-15 17:12:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:18,634 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-10-15 17:12:18,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-15 17:12:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) Word has length 24 [2022-10-15 17:12:18,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:18,637 INFO L225 Difference]: With dead ends: 34 [2022-10-15 17:12:18,637 INFO L226 Difference]: Without dead ends: 34 [2022-10-15 17:12:18,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-10-15 17:12:18,639 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 32 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:18,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:18,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-10-15 17:12:18,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-10-15 17:12:18,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (16), 7 states have call predecessors, (16), 6 states have call successors, (16) [2022-10-15 17:12:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2022-10-15 17:12:18,649 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2022-10-15 17:12:18,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:18,650 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2022-10-15 17:12:18,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 11 states have internal predecessors, (28), 7 states have call successors, (7), 1 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 7 states have call successors, (7) [2022-10-15 17:12:18,651 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-10-15 17:12:18,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-10-15 17:12:18,653 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:18,653 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:18,698 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:12:18,867 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:12:18,868 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:18,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:18,869 INFO L85 PathProgramCache]: Analyzing trace with hash 20539716, now seen corresponding path program 2 times [2022-10-15 17:12:18,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:18,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221348565] [2022-10-15 17:12:18,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:18,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:19,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:19,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:19,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:19,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:19,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:19,124 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-10-15 17:12:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:19,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221348565] [2022-10-15 17:12:19,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221348565] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:19,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589625737] [2022-10-15 17:12:19,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-10-15 17:12:19,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:19,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:19,127 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:12:19,145 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:12:19,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-10-15 17:12:19,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:19,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:12:19,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-10-15 17:12:19,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:19,698 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-10-15 17:12:19,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589625737] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:19,699 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:19,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 17 [2022-10-15 17:12:19,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645802892] [2022-10-15 17:12:19,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:19,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-10-15 17:12:19,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:19,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-10-15 17:12:19,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-10-15 17:12:19,707 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-10-15 17:12:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:19,913 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-10-15 17:12:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-10-15 17:12:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) Word has length 37 [2022-10-15 17:12:19,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:19,916 INFO L225 Difference]: With dead ends: 38 [2022-10-15 17:12:19,916 INFO L226 Difference]: Without dead ends: 38 [2022-10-15 17:12:19,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2022-10-15 17:12:19,918 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 71 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:19,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 78 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:19,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-10-15 17:12:19,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-10-15 17:12:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 26 states have internal predecessors, (30), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2022-10-15 17:12:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-10-15 17:12:19,927 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2022-10-15 17:12:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:19,928 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-10-15 17:12:19,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.933333333333333) internal successors, (44), 17 states have internal predecessors, (44), 10 states have call successors, (12), 1 states have call predecessors, (12), 7 states have return successors, (13), 6 states have call predecessors, (13), 10 states have call successors, (13) [2022-10-15 17:12:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-10-15 17:12:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-10-15 17:12:19,932 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:19,932 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:19,976 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:12:20,146 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:12:20,147 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:20,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1294996494, now seen corresponding path program 3 times [2022-10-15 17:12:20,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:20,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484955380] [2022-10-15 17:12:20,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:20,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:20,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:20,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2022-10-15 17:12:20,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:20,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484955380] [2022-10-15 17:12:20,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484955380] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:20,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761098162] [2022-10-15 17:12:20,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-10-15 17:12:20,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:20,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:20,791 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:12:20,811 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:12:20,862 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-10-15 17:12:20,862 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:20,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 8 conjunts are in the unsatisfiable core [2022-10-15 17:12:20,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:20,959 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-10-15 17:12:20,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 18 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2022-10-15 17:12:21,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761098162] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:21,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:21,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 19 [2022-10-15 17:12:21,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472102023] [2022-10-15 17:12:21,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:21,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-10-15 17:12:21,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:21,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-10-15 17:12:21,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2022-10-15 17:12:21,375 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-10-15 17:12:21,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:21,734 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-10-15 17:12:21,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-10-15 17:12:21,734 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) Word has length 93 [2022-10-15 17:12:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:21,737 INFO L225 Difference]: With dead ends: 57 [2022-10-15 17:12:21,737 INFO L226 Difference]: Without dead ends: 53 [2022-10-15 17:12:21,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 199 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=636, Unknown=0, NotChecked=0, Total=870 [2022-10-15 17:12:21,739 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 67 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:21,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 112 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:12:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-10-15 17:12:21,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2022-10-15 17:12:21,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 34 states have internal predecessors, (39), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (16), 9 states have call predecessors, (16), 8 states have call successors, (16) [2022-10-15 17:12:21,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2022-10-15 17:12:21,750 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 93 [2022-10-15 17:12:21,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:21,751 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2022-10-15 17:12:21,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 19 states have internal predecessors, (52), 9 states have call successors, (13), 1 states have call predecessors, (13), 8 states have return successors, (17), 12 states have call predecessors, (17), 9 states have call successors, (17) [2022-10-15 17:12:21,752 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2022-10-15 17:12:21,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-10-15 17:12:21,754 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:21,754 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:21,794 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:12:21,967 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:12:21,967 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:21,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:21,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1594983689, now seen corresponding path program 4 times [2022-10-15 17:12:21,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:21,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558111298] [2022-10-15 17:12:21,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:21,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:21,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:22,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:22,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:12:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:22,918 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 198 proven. 308 refuted. 0 times theorem prover too weak. 427 trivial. 0 not checked. [2022-10-15 17:12:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:22,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558111298] [2022-10-15 17:12:22,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558111298] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:22,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113840714] [2022-10-15 17:12:22,935 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-10-15 17:12:22,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:22,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:22,938 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:12:22,947 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:12:23,006 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-10-15 17:12:23,007 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:23,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjunts are in the unsatisfiable core [2022-10-15 17:12:23,014 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:23,090 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 326 refuted. 0 times theorem prover too weak. 555 trivial. 0 not checked. [2022-10-15 17:12:23,097 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 52 proven. 352 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-10-15 17:12:23,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113840714] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:23,960 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:23,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 13] total 27 [2022-10-15 17:12:23,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128666698] [2022-10-15 17:12:23,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:23,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-10-15 17:12:23,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-10-15 17:12:23,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=535, Unknown=0, NotChecked=0, Total=702 [2022-10-15 17:12:23,964 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) [2022-10-15 17:12:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:24,365 INFO L93 Difference]: Finished difference Result 73 states and 100 transitions. [2022-10-15 17:12:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-10-15 17:12:24,366 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) Word has length 133 [2022-10-15 17:12:24,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:24,368 INFO L225 Difference]: With dead ends: 73 [2022-10-15 17:12:24,368 INFO L226 Difference]: Without dead ends: 73 [2022-10-15 17:12:24,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 291 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=349, Invalid=983, Unknown=0, NotChecked=0, Total=1332 [2022-10-15 17:12:24,370 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 193 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:24,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 116 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-10-15 17:12:24,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-10-15 17:12:24,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-10-15 17:12:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.1041666666666667) internal successors, (53), 46 states have internal predecessors, (53), 11 states have call successors, (11), 9 states have call predecessors, (11), 7 states have return successors, (25), 11 states have call predecessors, (25), 11 states have call successors, (25) [2022-10-15 17:12:24,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 89 transitions. [2022-10-15 17:12:24,383 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 89 transitions. Word has length 133 [2022-10-15 17:12:24,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:24,384 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 89 transitions. [2022-10-15 17:12:24,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.68) internal successors, (67), 27 states have internal predecessors, (67), 20 states have call successors, (22), 1 states have call predecessors, (22), 10 states have return successors, (31), 16 states have call predecessors, (31), 20 states have call successors, (31) [2022-10-15 17:12:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 89 transitions. [2022-10-15 17:12:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-10-15 17:12:24,387 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:24,388 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:24,423 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:12:24,601 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:12:24,602 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:24,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:24,603 INFO L85 PathProgramCache]: Analyzing trace with hash 415114883, now seen corresponding path program 5 times [2022-10-15 17:12:24,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:24,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954050643] [2022-10-15 17:12:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:24,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:24,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-10-15 17:12:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:25,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:25,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-10-15 17:12:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:25,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:25,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-10-15 17:12:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-10-15 17:12:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-10-15 17:12:25,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-10-15 17:12:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-10-15 17:12:25,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-15 17:12:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2022-10-15 17:12:25,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-15 17:12:25,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954050643] [2022-10-15 17:12:25,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954050643] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-15 17:12:25,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713688956] [2022-10-15 17:12:25,464 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-10-15 17:12:25,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:25,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-15 17:12:25,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-15 17:12:25,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-15 17:12:25,596 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2022-10-15 17:12:25,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-10-15 17:12:25,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 10 conjunts are in the unsatisfiable core [2022-10-15 17:12:25,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-15 17:12:25,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2022-10-15 17:12:25,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-15 17:12:26,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 330 proven. 130 refuted. 0 times theorem prover too weak. 1194 trivial. 0 not checked. [2022-10-15 17:12:26,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713688956] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-15 17:12:26,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-15 17:12:26,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 11] total 20 [2022-10-15 17:12:26,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226298001] [2022-10-15 17:12:26,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-15 17:12:26,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-10-15 17:12:26,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-15 17:12:26,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-10-15 17:12:26,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2022-10-15 17:12:26,347 INFO L87 Difference]: Start difference. First operand 67 states and 89 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2022-10-15 17:12:26,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-15 17:12:26,551 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2022-10-15 17:12:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-15 17:12:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) Word has length 174 [2022-10-15 17:12:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-15 17:12:26,566 INFO L225 Difference]: With dead ends: 179 [2022-10-15 17:12:26,568 INFO L226 Difference]: Without dead ends: 179 [2022-10-15 17:12:26,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 387 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=149, Invalid=271, Unknown=0, NotChecked=0, Total=420 [2022-10-15 17:12:26,571 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 109 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-15 17:12:26,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 80 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-15 17:12:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-10-15 17:12:26,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 167. [2022-10-15 17:12:26,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 110 states have internal predecessors, (128), 33 states have call successors, (33), 19 states have call predecessors, (33), 18 states have return successors, (86), 37 states have call predecessors, (86), 33 states have call successors, (86) [2022-10-15 17:12:26,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 247 transitions. [2022-10-15 17:12:26,617 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 247 transitions. Word has length 174 [2022-10-15 17:12:26,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-15 17:12:26,617 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 247 transitions. [2022-10-15 17:12:26,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 20 states have internal predecessors, (53), 13 states have call successors, (17), 1 states have call predecessors, (17), 7 states have return successors, (23), 15 states have call predecessors, (23), 13 states have call successors, (23) [2022-10-15 17:12:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 247 transitions. [2022-10-15 17:12:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-10-15 17:12:26,632 INFO L187 NwaCegarLoop]: Found error trace [2022-10-15 17:12:26,633 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2022-10-15 17:12:26,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-15 17:12:26,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-15 17:12:26,834 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-10-15 17:12:26,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-15 17:12:26,835 INFO L85 PathProgramCache]: Analyzing trace with hash 647706620, now seen corresponding path program 6 times [2022-10-15 17:12:26,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-15 17:12:26,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798820696] [2022-10-15 17:12:26,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-15 17:12:26,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-15 17:12:26,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:12:26,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-10-15 17:12:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-10-15 17:12:26,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-10-15 17:12:26,984 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-10-15 17:12:26,986 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2022-10-15 17:12:26,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2022-10-15 17:12:26,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-10-15 17:12:26,992 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-10-15 17:12:26,998 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-15 17:12:27,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 05:12:27 BoogieIcfgContainer [2022-10-15 17:12:27,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-15 17:12:27,098 INFO L158 Benchmark]: Toolchain (without parser) took 12424.90ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 126.2MB in the beginning and 108.8MB in the end (delta: 17.4MB). Peak memory consumption was 85.0MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,098 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-15 17:12:27,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.67ms. Allocated memory is still 151.0MB. Free memory was 126.0MB in the beginning and 116.8MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.90ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 115.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,099 INFO L158 Benchmark]: Boogie Preprocessor took 22.37ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 114.4MB in the end (delta: 897.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,100 INFO L158 Benchmark]: RCFGBuilder took 433.53ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 104.7MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,103 INFO L158 Benchmark]: TraceAbstraction took 11655.85ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 104.1MB in the beginning and 108.8MB in the end (delta: -4.7MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. [2022-10-15 17:12:27,105 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.29ms. Allocated memory is still 151.0MB. Free memory is still 121.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.67ms. Allocated memory is still 151.0MB. Free memory was 126.0MB in the beginning and 116.8MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.90ms. Allocated memory is still 151.0MB. Free memory was 116.6MB in the beginning and 115.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.37ms. Allocated memory is still 151.0MB. Free memory was 115.3MB in the beginning and 114.4MB in the end (delta: 897.3kB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 433.53ms. Allocated memory is still 151.0MB. Free memory was 114.2MB in the beginning and 104.7MB in the end (delta: 9.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 11655.85ms. Allocated memory was 151.0MB in the beginning and 218.1MB in the end (delta: 67.1MB). Free memory was 104.1MB in the beginning and 108.8MB in the end (delta: -4.7MB). Peak memory consumption was 62.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 29]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 29. Possible FailurePath: [L26] int x = 7; VAL [x=7] [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) VAL [fibo(x)=13, x=7] [L27] int result = fibo(x); [L28] COND TRUE result == 13 VAL [result=13, x=7] [L29] reach_error() VAL [result=13, x=7] - UnprovableResult [Line: 25]: 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, 21 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 10, TraceHistogramMax: 41, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 555 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 523 mSDsluCounter, 683 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 513 mSDsCounter, 574 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 894 IncrementalHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 574 mSolverCounterUnsat, 170 mSDtfsCounter, 894 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1213 GetRequests, 1058 SyntacticMatches, 21 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=9, InterpolantAutomatonStates: 99, 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, 9 MinimizatonAttempts, 26 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 1283 NumberOfCodeBlocks, 1228 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1463 ConstructedInterpolants, 0 QuantifiedInterpolants, 2723 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1064 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 7201/9258 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:12:27,166 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...