./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ae007674 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/Fibonacci04.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 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-ae00767 [2021-12-28 00:58:49,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 00:58:49,169 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 00:58:49,209 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 00:58:49,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 00:58:49,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 00:58:49,216 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 00:58:49,221 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 00:58:49,223 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 00:58:49,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 00:58:49,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 00:58:49,231 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 00:58:49,232 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 00:58:49,234 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 00:58:49,235 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 00:58:49,237 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 00:58:49,237 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 00:58:49,238 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 00:58:49,242 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 00:58:49,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 00:58:49,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 00:58:49,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 00:58:49,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 00:58:49,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 00:58:49,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 00:58:49,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 00:58:49,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 00:58:49,258 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 00:58:49,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 00:58:49,259 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 00:58:49,260 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 00:58:49,260 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 00:58:49,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 00:58:49,262 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 00:58:49,263 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 00:58:49,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 00:58:49,264 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 00:58:49,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 00:58:49,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 00:58:49,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 00:58:49,267 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 00:58:49,268 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-28 00:58:49,298 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 00:58:49,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 00:58:49,298 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 00:58:49,298 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 00:58:49,299 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 00:58:49,299 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 00:58:49,300 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 00:58:49,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 00:58:49,300 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 00:58:49,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 00:58:49,300 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-28 00:58:49,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-28 00:58:49,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 00:58:49,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:49,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 00:58:49,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 00:58:49,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 8d19306ce3d42a6a85ce0e73aaa2bade9eaab24620b40f9180d62be222dc7b30 [2021-12-28 00:58:49,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 00:58:49,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 00:58:49,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 00:58:49,667 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 00:58:49,668 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 00:58:49,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci04.c [2021-12-28 00:58:49,726 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4414a7e39/9570778a30ac49c3a43d6469ac291c7f/FLAG331ed7ca6 [2021-12-28 00:58:50,166 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 00:58:50,166 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c [2021-12-28 00:58:50,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4414a7e39/9570778a30ac49c3a43d6469ac291c7f/FLAG331ed7ca6 [2021-12-28 00:58:50,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4414a7e39/9570778a30ac49c3a43d6469ac291c7f [2021-12-28 00:58:50,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 00:58:50,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 00:58:50,202 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:50,202 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 00:58:50,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 00:58:50,206 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5937ec2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50, skipping insertion in model container [2021-12-28 00:58:50,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 00:58:50,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 00:58:50,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-12-28 00:58:50,387 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:50,397 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 00:58:50,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci04.c[780,793] [2021-12-28 00:58:50,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 00:58:50,433 INFO L208 MainTranslator]: Completed translation [2021-12-28 00:58:50,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50 WrapperNode [2021-12-28 00:58:50,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 00:58:50,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:50,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 00:58:50,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 00:58:50,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,472 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-28 00:58:50,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 00:58:50,473 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 00:58:50,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 00:58:50,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 00:58:50,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,484 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,493 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 00:58:50,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 00:58:50,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 00:58:50,499 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 00:58:50,500 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (1/1) ... [2021-12-28 00:58:50,506 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 00:58:50,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:50,528 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) [2021-12-28 00:58:50,540 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 [2021-12-28 00:58:50,565 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-28 00:58:50,565 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-28 00:58:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 00:58:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 00:58:50,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 00:58:50,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 00:58:50,626 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 00:58:50,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 00:58:50,765 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 00:58:50,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 00:58:50,774 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 00:58:50,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:50 BoogieIcfgContainer [2021-12-28 00:58:50,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 00:58:50,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 00:58:50,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 00:58:50,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 00:58:50,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 12:58:50" (1/3) ... [2021-12-28 00:58:50,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1335ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:50, skipping insertion in model container [2021-12-28 00:58:50,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 12:58:50" (2/3) ... [2021-12-28 00:58:50,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1335ec6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 12:58:50, skipping insertion in model container [2021-12-28 00:58:50,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:50" (3/3) ... [2021-12-28 00:58:50,784 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci04.c [2021-12-28 00:58:50,789 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 00:58:50,789 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-28 00:58:50,837 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 00:58:50,845 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 00:58:50,845 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-28 00:58:50,861 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) [2021-12-28 00:58:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-28 00:58:50,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:50,872 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:50,874 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:50,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:50,879 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-28 00:58:50,886 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:50,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140753115] [2021-12-28 00:58:50,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:50,888 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 00:58:51,117 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:51,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140753115] [2021-12-28 00:58:51,118 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140753115] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 00:58:51,119 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 00:58:51,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 00:58:51,120 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199822251] [2021-12-28 00:58:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 00:58:51,124 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 00:58:51,125 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:51,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 00:58:51,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 00:58:51,152 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) [2021-12-28 00:58:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:51,239 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-28 00:58:51,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 00:58:51,241 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 [2021-12-28 00:58:51,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:51,249 INFO L225 Difference]: With dead ends: 31 [2021-12-28 00:58:51,250 INFO L226 Difference]: Without dead ends: 18 [2021-12-28 00:58:51,252 INFO L932 BasicCegarLoop]: 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 [2021-12-28 00:58:51,255 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:51,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 00:58:51,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-28 00:58:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-28 00:58:51,292 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) [2021-12-28 00:58:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-28 00:58:51,295 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-28 00:58:51,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:51,295 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-28 00:58:51,296 INFO L471 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) [2021-12-28 00:58:51,296 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-28 00:58:51,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-28 00:58:51,299 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:51,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:51,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 00:58:51,301 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:51,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:51,303 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-28 00:58:51,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:51,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745982408] [2021-12-28 00:58:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:51,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:51,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-28 00:58:51,359 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:51,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745982408] [2021-12-28 00:58:51,359 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745982408] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 00:58:51,360 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 00:58:51,360 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-28 00:58:51,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463450683] [2021-12-28 00:58:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 00:58:51,361 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-28 00:58:51,362 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:51,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-28 00:58:51,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-28 00:58:51,363 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) [2021-12-28 00:58:51,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:51,400 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-28 00:58:51,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-28 00:58:51,401 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 [2021-12-28 00:58:51,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:51,402 INFO L225 Difference]: With dead ends: 24 [2021-12-28 00:58:51,402 INFO L226 Difference]: Without dead ends: 20 [2021-12-28 00:58:51,402 INFO L932 BasicCegarLoop]: 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 [2021-12-28 00:58:51,403 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:51,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-28 00:58:51,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-28 00:58:51,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-28 00:58:51,409 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) [2021-12-28 00:58:51,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-28 00:58:51,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-28 00:58:51,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:51,410 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-28 00:58:51,410 INFO L471 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) [2021-12-28 00:58:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-28 00:58:51,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-28 00:58:51,411 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:51,412 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:51,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 00:58:51,412 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:51,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:51,413 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-28 00:58:51,413 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:51,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895411655] [2021-12-28 00:58:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:51,414 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:51,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-28 00:58:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 00:58:51,563 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895411655] [2021-12-28 00:58:51,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895411655] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:51,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634184165] [2021-12-28 00:58:51,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:51,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:51,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:51,568 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) [2021-12-28 00:58:51,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-28 00:58:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:51,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-28 00:58:51,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:51,767 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-28 00:58:51,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-28 00:58:52,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634184165] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:52,078 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:52,078 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-28 00:58:52,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404708379] [2021-12-28 00:58:52,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:52,088 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-28 00:58:52,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:52,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-28 00:58:52,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-28 00:58:52,093 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) [2021-12-28 00:58:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:52,293 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-28 00:58:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-28 00:58:52,294 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 [2021-12-28 00:58:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:52,298 INFO L225 Difference]: With dead ends: 46 [2021-12-28 00:58:52,298 INFO L226 Difference]: Without dead ends: 29 [2021-12-28 00:58:52,300 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-12-28 00:58:52,304 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:52,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:52,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-28 00:58:52,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-28 00:58:52,319 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) [2021-12-28 00:58:52,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-28 00:58:52,321 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-28 00:58:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:52,322 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-28 00:58:52,322 INFO L471 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) [2021-12-28 00:58:52,322 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-28 00:58:52,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-28 00:58:52,327 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:52,327 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:52,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-28 00:58:52,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:52,552 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-28 00:58:52,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:52,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051080596] [2021-12-28 00:58:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,553 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:52,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:52,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,841 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-28 00:58:52,842 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051080596] [2021-12-28 00:58:52,842 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051080596] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:52,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734208988] [2021-12-28 00:58:52,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:52,843 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:52,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:52,844 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) [2021-12-28 00:58:52,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-28 00:58:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:52,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-28 00:58:52,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:53,096 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-28 00:58:53,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-28 00:58:53,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734208988] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:53,493 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:53,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-28 00:58:53,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027072302] [2021-12-28 00:58:53,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:53,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-28 00:58:53,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-28 00:58:53,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-28 00:58:53,496 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) [2021-12-28 00:58:53,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:53,699 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2021-12-28 00:58:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 00:58:53,700 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 [2021-12-28 00:58:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:53,706 INFO L225 Difference]: With dead ends: 73 [2021-12-28 00:58:53,707 INFO L226 Difference]: Without dead ends: 44 [2021-12-28 00:58:53,708 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=392, Unknown=0, NotChecked=0, Total=552 [2021-12-28 00:58:53,709 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 37 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:53,710 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 94 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-28 00:58:53,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-28 00:58:53,717 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, (19), 9 states have call predecessors, (19), 7 states have call successors, (19) [2021-12-28 00:58:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 61 transitions. [2021-12-28 00:58:53,718 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 61 transitions. Word has length 65 [2021-12-28 00:58:53,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:53,719 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 61 transitions. [2021-12-28 00:58:53,719 INFO L471 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) [2021-12-28 00:58:53,719 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 61 transitions. [2021-12-28 00:58:53,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2021-12-28 00:58:53,721 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:53,721 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 10, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:53,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 [2021-12-28 00:58:53,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-28 00:58:53,936 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:53,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:53,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1961744707, now seen corresponding path program 2 times [2021-12-28 00:58:53,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:53,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408790445] [2021-12-28 00:58:53,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:53,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:53,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 00:58:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-28 00:58:54,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-28 00:58:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-28 00:58:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 00:58:54,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 00:58:54,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 00:58:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 85 proven. 119 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2021-12-28 00:58:54,234 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 00:58:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408790445] [2021-12-28 00:58:54,236 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408790445] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-28 00:58:54,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169100160] [2021-12-28 00:58:54,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-28 00:58:54,237 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:54,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 00:58:54,240 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) [2021-12-28 00:58:54,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-28 00:58:54,314 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-28 00:58:54,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-28 00:58:54,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-28 00:58:54,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-28 00:58:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 158 refuted. 0 times theorem prover too weak. 327 trivial. 0 not checked. [2021-12-28 00:58:54,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-28 00:58:55,190 INFO L134 CoverageAnalysis]: Checked inductivity of 549 backedges. 64 proven. 170 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2021-12-28 00:58:55,191 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169100160] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-28 00:58:55,191 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-28 00:58:55,191 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 11] total 17 [2021-12-28 00:58:55,191 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658955028] [2021-12-28 00:58:55,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-28 00:58:55,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-12-28 00:58:55,192 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 00:58:55,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-12-28 00:58:55,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-28 00:58:55,193 INFO L87 Difference]: Start difference. First operand 44 states and 61 transitions. Second operand has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2021-12-28 00:58:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 00:58:55,411 INFO L93 Difference]: Finished difference Result 101 states and 150 transitions. [2021-12-28 00:58:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-28 00:58:55,412 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) Word has length 104 [2021-12-28 00:58:55,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 00:58:55,416 INFO L225 Difference]: With dead ends: 101 [2021-12-28 00:58:55,417 INFO L226 Difference]: Without dead ends: 60 [2021-12-28 00:58:55,421 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 227 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2021-12-28 00:58:55,422 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 66 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-28 00:58:55,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 92 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-28 00:58:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2021-12-28 00:58:55,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2021-12-28 00:58:55,439 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, (16), 9 states have call predecessors, (16), 7 states have call successors, (16) [2021-12-28 00:58:55,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 58 transitions. [2021-12-28 00:58:55,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 58 transitions. Word has length 104 [2021-12-28 00:58:55,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 00:58:55,443 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 58 transitions. [2021-12-28 00:58:55,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.9411764705882355) internal successors, (50), 17 states have internal predecessors, (50), 10 states have call successors, (15), 1 states have call predecessors, (15), 7 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2021-12-28 00:58:55,444 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2021-12-28 00:58:55,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-12-28 00:58:55,451 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 00:58:55,451 INFO L514 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1] [2021-12-28 00:58:55,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-28 00:58:55,667 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-28 00:58:55,667 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-28 00:58:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 00:58:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -2094125593, now seen corresponding path program 3 times [2021-12-28 00:58:55,668 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 00:58:55,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963012754] [2021-12-28 00:58:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 00:58:55,668 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 00:58:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 00:58:55,693 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-28 00:58:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-28 00:58:55,746 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-28 00:58:55,746 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-28 00:58:55,747 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-28 00:58:55,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 00:58:55,751 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2021-12-28 00:58:55,755 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-28 00:58:55,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 12:58:55 BoogieIcfgContainer [2021-12-28 00:58:55,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-28 00:58:55,825 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-28 00:58:55,825 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-28 00:58:55,826 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-28 00:58:55,827 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 12:58:50" (3/4) ... [2021-12-28 00:58:55,828 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-28 00:58:55,882 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-28 00:58:55,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-28 00:58:55,883 INFO L158 Benchmark]: Toolchain (without parser) took 5683.83ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 47.5MB in the beginning and 45.1MB in the end (delta: 2.4MB). Peak memory consumption was 30.8MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,883 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 00:58:55,884 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 62.9MB. Free memory was 47.3MB in the beginning and 47.0MB in the end (delta: 351.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,884 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.08ms. Allocated memory is still 62.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,884 INFO L158 Benchmark]: Boogie Preprocessor took 23.82ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 44.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-28 00:58:55,890 INFO L158 Benchmark]: RCFGBuilder took 278.89ms. Allocated memory is still 62.9MB. Free memory was 44.5MB in the beginning and 35.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,891 INFO L158 Benchmark]: TraceAbstraction took 5046.86ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 35.4MB in the beginning and 49.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,891 INFO L158 Benchmark]: Witness Printer took 57.03ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 45.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-28 00:58:55,893 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.25ms. Allocated memory is still 46.1MB. Free memory was 28.2MB in the beginning and 28.2MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.26ms. Allocated memory is still 62.9MB. Free memory was 47.3MB in the beginning and 47.0MB in the end (delta: 351.4kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.08ms. Allocated memory is still 62.9MB. Free memory was 47.0MB in the beginning and 45.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.82ms. Allocated memory is still 62.9MB. Free memory was 45.5MB in the beginning and 44.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 278.89ms. Allocated memory is still 62.9MB. Free memory was 44.5MB in the beginning and 35.9MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5046.86ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 35.4MB in the beginning and 49.3MB in the end (delta: -13.8MB). Peak memory consumption was 17.6MB. Max. memory is 16.1GB. * Witness Printer took 57.03ms. Allocated memory is still 92.3MB. Free memory was 49.3MB in the beginning and 45.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 35]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L30] int x = __VERIFIER_nondet_int(); [L31] CALL, EXPR fibonacci(x) VAL [\old(n)=5] [L19] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L21] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L19] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L21] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L19] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L21] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L19] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L21] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L24] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L19] COND TRUE n < 1 [L20] return 0; VAL [\old(n)=0, \result=0, n=0] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L24] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L19] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L21] COND TRUE n == 1 [L22] return 1; VAL [\old(n)=1, \result=1, n=1] [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L24] return fibonacci(n-1) + fibonacci(n-2); [L24] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L24] return fibonacci(n-1) + fibonacci(n-2); [L31] RET, EXPR fibonacci(x) VAL [fibonacci(x)=5, x=5] [L31] int result = fibonacci(x); [L32] COND FALSE !(x != 5 || result == 3) VAL [result=5, x=5] [L35] reach_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 15, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 325 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 507 IncrementalHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 77 mSDtfsCounter, 507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 421 SyntacticMatches, 7 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=4, InterpolantAutomatonStates: 52, 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, 5 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 511 NumberOfCodeBlocks, 511 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 586 ConstructedInterpolants, 0 QuantifiedInterpolants, 1103 SizeOfPredicates, 10 NumberOfNonLiveVariables, 501 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 1567/2250 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! [2021-12-28 00:58:55,932 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