./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Fibonacci05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 02:55:16,909 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 02:55:16,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 02:55:16,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 02:55:16,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 02:55:16,958 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 02:55:16,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 02:55:16,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 02:55:16,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 02:55:16,969 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 02:55:16,971 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 02:55:16,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 02:55:16,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 02:55:16,976 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 02:55:16,977 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 02:55:16,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 02:55:16,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 02:55:16,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 02:55:16,983 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 02:55:16,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 02:55:16,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 02:55:16,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 02:55:16,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 02:55:16,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 02:55:17,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 02:55:17,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 02:55:17,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 02:55:17,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 02:55:17,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 02:55:17,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 02:55:17,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 02:55:17,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 02:55:17,008 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 02:55:17,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 02:55:17,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 02:55:17,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 02:55:17,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 02:55:17,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 02:55:17,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 02:55:17,014 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 02:55:17,015 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 02:55:17,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-16 02:55:17,040 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 02:55:17,041 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 02:55:17,041 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 02:55:17,041 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 02:55:17,042 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 02:55:17,042 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 02:55:17,043 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 02:55:17,043 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 02:55:17,043 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 02:55:17,044 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 02:55:17,044 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-16 02:55:17,045 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 02:55:17,046 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-16 02:55:17,046 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 02:55:17,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-16 02:55:17,046 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 02:55:17,046 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 02:55:17,046 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 02:55:17,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:55:17,047 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 02:55:17,047 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 02:55:17,047 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-16 02:55:17,047 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 02:55:17,048 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 02:55:17,049 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2023-02-16 02:55:17,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 02:55:17,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 02:55:17,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 02:55:17,356 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 02:55:17,361 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 02:55:17,362 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-16 02:55:18,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 02:55:18,795 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 02:55:18,796 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-16 02:55:18,800 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0794db28/8820aeead1f344128934b5cde6a86297/FLAGe0c749875 [2023-02-16 02:55:18,812 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0794db28/8820aeead1f344128934b5cde6a86297 [2023-02-16 02:55:18,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 02:55:18,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 02:55:18,821 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 02:55:18,821 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 02:55:18,824 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 02:55:18,825 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:55:18" (1/1) ... [2023-02-16 02:55:18,826 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@485b0d4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:18, skipping insertion in model container [2023-02-16 02:55:18,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 02:55:18" (1/1) ... [2023-02-16 02:55:18,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 02:55:18,850 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 02:55:18,964 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2023-02-16 02:55:18,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:55:18,977 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 02:55:18,988 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2023-02-16 02:55:18,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 02:55:19,000 INFO L208 MainTranslator]: Completed translation [2023-02-16 02:55:19,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19 WrapperNode [2023-02-16 02:55:19,001 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 02:55:19,002 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 02:55:19,003 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 02:55:19,003 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 02:55:19,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,014 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,026 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-16 02:55:19,027 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 02:55:19,027 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 02:55:19,027 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 02:55:19,027 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 02:55:19,033 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,040 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,045 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 02:55:19,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 02:55:19,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 02:55:19,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 02:55:19,051 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (1/1) ... [2023-02-16 02:55:19,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 02:55:19,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:55:19,082 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) [2023-02-16 02:55:19,089 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 [2023-02-16 02:55:19,115 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-16 02:55:19,115 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-16 02:55:19,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 02:55:19,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 02:55:19,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 02:55:19,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 02:55:19,170 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 02:55:19,172 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 02:55:19,340 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 02:55:19,351 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 02:55:19,353 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-16 02:55:19,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:55:19 BoogieIcfgContainer [2023-02-16 02:55:19,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 02:55:19,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 02:55:19,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 02:55:19,361 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 02:55:19,361 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 02:55:18" (1/3) ... [2023-02-16 02:55:19,362 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b095405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:55:19, skipping insertion in model container [2023-02-16 02:55:19,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 02:55:19" (2/3) ... [2023-02-16 02:55:19,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b095405 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 02:55:19, skipping insertion in model container [2023-02-16 02:55:19,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:55:19" (3/3) ... [2023-02-16 02:55:19,364 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-02-16 02:55:19,382 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 02:55:19,382 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-16 02:55:19,441 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 02:55:19,448 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5941ecbe, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 02:55:19,449 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-16 02:55:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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) [2023-02-16 02:55:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 02:55:19,462 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:19,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:19,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:19,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:19,468 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-16 02:55:19,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:19,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362467404] [2023-02-16 02:55:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:19,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:19,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:19,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:19,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:55:19,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:19,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362467404] [2023-02-16 02:55:19,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362467404] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:55:19,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:55:19,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:55:19,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157330807] [2023-02-16 02:55:19,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:55:19,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:55:19,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:19,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:55:19,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:55:19,869 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 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), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 02:55:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:19,969 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-16 02:55:19,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:55:19,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-02-16 02:55:19,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:19,980 INFO L225 Difference]: With dead ends: 31 [2023-02-16 02:55:19,980 INFO L226 Difference]: Without dead ends: 18 [2023-02-16 02:55:19,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 02:55:19,986 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:19,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 40 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:55:20,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-16 02:55:20,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-16 02:55:20,039 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) [2023-02-16 02:55:20,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-16 02:55:20,042 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-16 02:55:20,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:20,042 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-16 02:55:20,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 02:55:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-16 02:55:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 02:55:20,044 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:20,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:20,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 02:55:20,045 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:20,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:20,045 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-16 02:55:20,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:20,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113617883] [2023-02-16 02:55:20,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:20,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 02:55:20,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:20,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113617883] [2023-02-16 02:55:20,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113617883] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 02:55:20,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 02:55:20,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 02:55:20,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420926228] [2023-02-16 02:55:20,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 02:55:20,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 02:55:20,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:20,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 02:55:20,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 02:55:20,129 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 02:55:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:20,168 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-16 02:55:20,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 02:55:20,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2023-02-16 02:55:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:20,170 INFO L225 Difference]: With dead ends: 24 [2023-02-16 02:55:20,170 INFO L226 Difference]: Without dead ends: 20 [2023-02-16 02:55:20,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-16 02:55:20,198 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:20,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 02:55:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-16 02:55:20,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-16 02:55:20,203 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) [2023-02-16 02:55:20,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-16 02:55:20,229 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-16 02:55:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:20,229 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-16 02:55:20,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 02:55:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-16 02:55:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 02:55:20,230 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:20,231 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:20,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 02:55:20,231 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:20,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:20,232 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-16 02:55:20,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:20,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769343376] [2023-02-16 02:55:20,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:20,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:20,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-16 02:55:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:55:20,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:20,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769343376] [2023-02-16 02:55:20,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769343376] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:55:20,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118052401] [2023-02-16 02:55:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:20,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:20,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:55:20,474 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:55:20,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 02:55:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:20,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 02:55:20,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:55:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-02-16 02:55:20,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:55:20,911 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-16 02:55:20,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118052401] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:55:20,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:55:20,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-16 02:55:20,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32969151] [2023-02-16 02:55:20,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:55:20,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-16 02:55:20,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:20,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-16 02:55:20,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-16 02:55:20,924 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 02:55:21,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:21,143 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-16 02:55:21,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 02:55:21,144 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2023-02-16 02:55:21,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:21,145 INFO L225 Difference]: With dead ends: 46 [2023-02-16 02:55:21,146 INFO L226 Difference]: Without dead ends: 29 [2023-02-16 02:55:21,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-16 02:55:21,148 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:21,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 63 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:55:21,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-16 02:55:21,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-16 02:55:21,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2023-02-16 02:55:21,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-16 02:55:21,156 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-16 02:55:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:21,157 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-16 02:55:21,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-02-16 02:55:21,157 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-16 02:55:21,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-16 02:55:21,160 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:21,160 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:21,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 02:55:21,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:21,365 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:21,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-16 02:55:21,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:21,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732987080] [2023-02-16 02:55:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:21,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:21,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:21,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:21,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:21,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2023-02-16 02:55:21,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732987080] [2023-02-16 02:55:21,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732987080] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:55:21,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063240381] [2023-02-16 02:55:21,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:21,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:21,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:55:21,812 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:55:21,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 02:55:21,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:21,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-16 02:55:21,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:55:22,002 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2023-02-16 02:55:22,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:55:22,458 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-02-16 02:55:22,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063240381] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:55:22,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:55:22,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-16 02:55:22,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187169600] [2023-02-16 02:55:22,459 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:55:22,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-16 02:55:22,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:22,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-16 02:55:22,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-16 02:55:22,467 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-16 02:55:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:22,713 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2023-02-16 02:55:22,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 02:55:22,714 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2023-02-16 02:55:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:22,716 INFO L225 Difference]: With dead ends: 73 [2023-02-16 02:55:22,717 INFO L226 Difference]: Without dead ends: 44 [2023-02-16 02:55:22,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-16 02:55:22,718 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:22,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 93 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 02:55:22,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-16 02:55:22,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-16 02:55:22,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (24), 9 states have call predecessors, (24), 7 states have call successors, (24) [2023-02-16 02:55:22,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-02-16 02:55:22,729 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2023-02-16 02:55:22,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:22,730 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-02-16 02:55:22,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2023-02-16 02:55:22,730 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-02-16 02:55:22,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-02-16 02:55:22,735 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:22,735 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:22,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 02:55:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-02-16 02:55:22,943 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:22,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2023-02-16 02:55:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:22,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357091107] [2023-02-16 02:55:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:22,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:22,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 02:55:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:23,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-16 02:55:23,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 02:55:23,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:23,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-16 02:55:23,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:23,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2023-02-16 02:55:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:23,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357091107] [2023-02-16 02:55:23,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357091107] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:55:23,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68962000] [2023-02-16 02:55:23,725 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 02:55:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:55:23,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:55:23,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 02:55:23,825 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 02:55:23,825 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:55:23,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 02:55:23,833 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:55:23,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2023-02-16 02:55:23,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:55:24,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2023-02-16 02:55:24,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68962000] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:55:24,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:55:24,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-02-16 02:55:24,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899251535] [2023-02-16 02:55:24,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:55:24,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 02:55:24,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:24,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 02:55:24,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-02-16 02:55:24,885 INFO L87 Difference]: Start difference. First operand 44 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-16 02:55:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:25,454 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2023-02-16 02:55:25,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-16 02:55:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 171 [2023-02-16 02:55:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:25,457 INFO L225 Difference]: With dead ends: 119 [2023-02-16 02:55:25,457 INFO L226 Difference]: Without dead ends: 76 [2023-02-16 02:55:25,459 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 384 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-02-16 02:55:25,460 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:25,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 108 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 02:55:25,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-16 02:55:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2023-02-16 02:55:25,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 45 states have internal predecessors, (56), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (37), 13 states have call predecessors, (37), 12 states have call successors, (37) [2023-02-16 02:55:25,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2023-02-16 02:55:25,475 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2023-02-16 02:55:25,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:25,477 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2023-02-16 02:55:25,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 15 states have call successors, (18), 1 states have call predecessors, (18), 10 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2023-02-16 02:55:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2023-02-16 02:55:25,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2023-02-16 02:55:25,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:25,485 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:25,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-16 02:55:25,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:25,693 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2023-02-16 02:55:25,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:25,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430475714] [2023-02-16 02:55:25,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:25,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:25,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-16 02:55:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:55:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:26,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:55:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:55:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:55:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:26,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:26,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-16 02:55:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:55:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-16 02:55:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-16 02:55:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-16 02:55:27,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-16 02:55:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-16 02:55:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-16 02:55:27,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 02:55:27,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2023-02-16 02:55:27,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 02:55:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430475714] [2023-02-16 02:55:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430475714] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 02:55:27,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006829725] [2023-02-16 02:55:27,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-16 02:55:27,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:27,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 02:55:27,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 02:55:27,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 02:55:27,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-02-16 02:55:27,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 02:55:27,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-16 02:55:27,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 02:55:27,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2023-02-16 02:55:27,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 02:55:29,552 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2023-02-16 02:55:29,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006829725] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 02:55:29,552 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 02:55:29,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-02-16 02:55:29,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264247882] [2023-02-16 02:55:29,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 02:55:29,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-16 02:55:29,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 02:55:29,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-16 02:55:29,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-02-16 02:55:29,559 INFO L87 Difference]: Start difference. First operand 66 states and 105 transitions. Second operand has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-02-16 02:55:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 02:55:30,101 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2023-02-16 02:55:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-16 02:55:30,103 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) Word has length 351 [2023-02-16 02:55:30,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 02:55:30,111 INFO L225 Difference]: With dead ends: 172 [2023-02-16 02:55:30,111 INFO L226 Difference]: Without dead ends: 109 [2023-02-16 02:55:30,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 787 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2023-02-16 02:55:30,115 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 140 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 241 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 241 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 02:55:30,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 171 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [241 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 02:55:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-16 02:55:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2023-02-16 02:55:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 64 states have (on average 1.109375) internal successors, (71), 62 states have internal predecessors, (71), 17 states have call successors, (17), 12 states have call predecessors, (17), 9 states have return successors, (38), 16 states have call predecessors, (38), 17 states have call successors, (38) [2023-02-16 02:55:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2023-02-16 02:55:30,146 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2023-02-16 02:55:30,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 02:55:30,148 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2023-02-16 02:55:30,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.515151515151515) internal successors, (83), 33 states have internal predecessors, (83), 24 states have call successors, (28), 1 states have call predecessors, (28), 13 states have return successors, (42), 23 states have call predecessors, (42), 24 states have call successors, (42) [2023-02-16 02:55:30,148 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2023-02-16 02:55:30,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2023-02-16 02:55:30,159 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 02:55:30,160 INFO L195 NwaCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 02:55:30,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-16 02:55:30,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 02:55:30,372 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-16 02:55:30,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 02:55:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 4 times [2023-02-16 02:55:30,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 02:55:30,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942873291] [2023-02-16 02:55:30,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 02:55:30,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 02:55:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:55:30,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-16 02:55:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-16 02:55:30,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-16 02:55:30,574 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-16 02:55:30,576 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-16 02:55:30,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 02:55:30,592 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-16 02:55:30,599 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-16 02:55:30,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.02 02:55:30 BoogieIcfgContainer [2023-02-16 02:55:30,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-16 02:55:30,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-16 02:55:30,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-16 02:55:30,689 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-16 02:55:30,689 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 02:55:19" (3/4) ... [2023-02-16 02:55:30,691 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-16 02:55:30,792 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-16 02:55:30,792 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-16 02:55:30,793 INFO L158 Benchmark]: Toolchain (without parser) took 11976.87ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 108.9MB in the beginning and 157.1MB in the end (delta: -48.2MB). Peak memory consumption was 113.1MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,793 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 138.4MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:55:30,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.60ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 98.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.41ms. Allocated memory is still 138.4MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 02:55:30,794 INFO L158 Benchmark]: Boogie Preprocessor took 20.60ms. Allocated memory is still 138.4MB. Free memory was 97.3MB in the beginning and 96.4MB in the end (delta: 890.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,795 INFO L158 Benchmark]: RCFGBuilder took 307.20ms. Allocated memory is still 138.4MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,795 INFO L158 Benchmark]: TraceAbstraction took 11330.38ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 86.0MB in the beginning and 166.6MB in the end (delta: -80.7MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,795 INFO L158 Benchmark]: Witness Printer took 104.03ms. Allocated memory is still 297.8MB. Free memory was 166.6MB in the beginning and 157.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 02:55:30,797 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.32ms. Allocated memory is still 138.4MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 180.60ms. Allocated memory is still 138.4MB. Free memory was 108.5MB in the beginning and 98.9MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.41ms. Allocated memory is still 138.4MB. Free memory was 98.9MB in the beginning and 97.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.60ms. Allocated memory is still 138.4MB. Free memory was 97.3MB in the beginning and 96.4MB in the end (delta: 890.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 307.20ms. Allocated memory is still 138.4MB. Free memory was 96.4MB in the beginning and 86.9MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 11330.38ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 86.0MB in the beginning and 166.6MB in the end (delta: -80.7MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 104.03ms. Allocated memory is still 297.8MB. Free memory was 166.6MB in the beginning and 157.1MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.2s, OverallIterations: 7, TraceHistogramMax: 67, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 318 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 558 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1034 IncrementalHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 558 mSolverCounterUnsat, 103 mSDtfsCounter, 1034 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1518 GetRequests, 1364 SyntacticMatches, 15 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1415 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=6, InterpolantAutomatonStates: 100, 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, 6 MinimizatonAttempts, 30 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1837 ConstructedInterpolants, 0 QuantifiedInterpolants, 2982 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1233 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 20564/26763 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-16 02:55:30,822 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE