./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 574ddb4e 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-?-574ddb4 [2023-02-17 07:59:02,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 07:59:02,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 07:59:02,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 07:59:02,713 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 07:59:02,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 07:59:02,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 07:59:02,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 07:59:02,720 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 07:59:02,723 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 07:59:02,724 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 07:59:02,726 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 07:59:02,726 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 07:59:02,728 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 07:59:02,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 07:59:02,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 07:59:02,730 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 07:59:02,731 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 07:59:02,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 07:59:02,736 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 07:59:02,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 07:59:02,737 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 07:59:02,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 07:59:02,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 07:59:02,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 07:59:02,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 07:59:02,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 07:59:02,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 07:59:02,748 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 07:59:02,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 07:59:02,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 07:59:02,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 07:59:02,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 07:59:02,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 07:59:02,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 07:59:02,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 07:59:02,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 07:59:02,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 07:59:02,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 07:59:02,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 07:59:02,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 07:59:02,756 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-02-17 07:59:02,781 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 07:59:02,781 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 07:59:02,782 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 07:59:02,782 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 07:59:02,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 07:59:02,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 07:59:02,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 07:59:02,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 07:59:02,783 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 07:59:02,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-02-17 07:59:02,784 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-02-17 07:59:02,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:59:02,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 07:59:02,785 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 07:59:02,786 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 07:59:02,786 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-17 07:59:02,999 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 07:59:03,019 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 07:59:03,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 07:59:03,022 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 07:59:03,022 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 07:59:03,023 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-17 07:59:04,173 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 07:59:04,325 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 07:59:04,325 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2023-02-17 07:59:04,329 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018b81268/01b1ee995ff4427297cba6aee42c2b2e/FLAG5a3ad419d [2023-02-17 07:59:04,339 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/018b81268/01b1ee995ff4427297cba6aee42c2b2e [2023-02-17 07:59:04,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 07:59:04,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 07:59:04,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 07:59:04,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 07:59:04,346 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 07:59:04,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,347 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39e9a22f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04, skipping insertion in model container [2023-02-17 07:59:04,347 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,352 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 07:59:04,361 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 07:59:04,449 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-17 07:59:04,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:59:04,459 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 07:59:04,470 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-17 07:59:04,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 07:59:04,480 INFO L208 MainTranslator]: Completed translation [2023-02-17 07:59:04,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04 WrapperNode [2023-02-17 07:59:04,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 07:59:04,481 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 07:59:04,482 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 07:59:04,482 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 07:59:04,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,491 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,502 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2023-02-17 07:59:04,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 07:59:04,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 07:59:04,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 07:59:04,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 07:59:04,508 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,511 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,512 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,513 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 07:59:04,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 07:59:04,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 07:59:04,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 07:59:04,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (1/1) ... [2023-02-17 07:59:04,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 07:59:04,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:04,537 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-17 07:59:04,549 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-17 07:59:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2023-02-17 07:59:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2023-02-17 07:59:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 07:59:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 07:59:04,565 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 07:59:04,565 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 07:59:04,603 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 07:59:04,605 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 07:59:04,680 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 07:59:04,685 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 07:59:04,685 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2023-02-17 07:59:04,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:04 BoogieIcfgContainer [2023-02-17 07:59:04,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 07:59:04,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 07:59:04,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 07:59:04,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 07:59:04,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 07:59:04" (1/3) ... [2023-02-17 07:59:04,691 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1556979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:59:04, skipping insertion in model container [2023-02-17 07:59:04,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 07:59:04" (2/3) ... [2023-02-17 07:59:04,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1556979b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 07:59:04, skipping insertion in model container [2023-02-17 07:59:04,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:04" (3/3) ... [2023-02-17 07:59:04,692 INFO L112 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2023-02-17 07:59:04,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 07:59:04,710 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-02-17 07:59:04,740 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 07:59:04,745 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;@56d6e9e1, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 07:59:04,745 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-02-17 07:59:04,748 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-17 07:59:04,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-17 07:59:04,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:04,754 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:04,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:04,758 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2023-02-17 07:59:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:04,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170089073] [2023-02-17 07:59:04,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:04,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:04,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:04,935 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-17 07:59:04,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:04,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170089073] [2023-02-17 07:59:04,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170089073] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:59:04,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:59:04,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:59:04,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283978338] [2023-02-17 07:59:04,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:59:04,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:59:04,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:04,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:59:04,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:59:04,975 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-17 07:59:05,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:05,028 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2023-02-17 07:59:05,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:59:05,031 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-17 07:59:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:05,035 INFO L225 Difference]: With dead ends: 31 [2023-02-17 07:59:05,036 INFO L226 Difference]: Without dead ends: 18 [2023-02-17 07:59:05,037 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-17 07:59:05,040 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:05,040 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.0s Time] [2023-02-17 07:59:05,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-02-17 07:59:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-02-17 07:59:05,072 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-17 07:59:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-17 07:59:05,074 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2023-02-17 07:59:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:05,074 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-17 07:59:05,074 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-17 07:59:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-17 07:59:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-17 07:59:05,075 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:05,076 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 07:59:05,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 07:59:05,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:05,086 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2023-02-17 07:59:05,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:05,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269212887] [2023-02-17 07:59:05,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,148 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-17 07:59:05,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:05,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269212887] [2023-02-17 07:59:05,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269212887] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 07:59:05,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 07:59:05,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-17 07:59:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795318489] [2023-02-17 07:59:05,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 07:59:05,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 07:59:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:05,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 07:59:05,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 07:59:05,151 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-17 07:59:05,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:05,185 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2023-02-17 07:59:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 07:59:05,186 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-17 07:59:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:05,186 INFO L225 Difference]: With dead ends: 24 [2023-02-17 07:59:05,186 INFO L226 Difference]: Without dead ends: 20 [2023-02-17 07:59:05,187 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-17 07:59:05,188 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-17 07:59:05,188 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-17 07:59:05,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-02-17 07:59:05,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2023-02-17 07:59:05,192 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-17 07:59:05,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2023-02-17 07:59:05,193 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2023-02-17 07:59:05,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:05,194 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2023-02-17 07:59:05,194 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-17 07:59:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2023-02-17 07:59:05,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-17 07:59:05,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:05,195 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-17 07:59:05,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 07:59:05,196 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:05,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2023-02-17 07:59:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:05,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003044451] [2023-02-17 07:59:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:05,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-02-17 07:59:05,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,329 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-17 07:59:05,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:05,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003044451] [2023-02-17 07:59:05,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003044451] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:05,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [699953944] [2023-02-17 07:59:05,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:05,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:05,332 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-17 07:59:05,372 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-17 07:59:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:05,419 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-17 07:59:05,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:05,495 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-17 07:59:05,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:05,586 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-17 07:59:05,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [699953944] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:05,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:05,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2023-02-17 07:59:05,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262133373] [2023-02-17 07:59:05,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:05,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-17 07:59:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:05,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-17 07:59:05,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2023-02-17 07:59:05,589 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-17 07:59:05,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:05,769 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2023-02-17 07:59:05,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-17 07:59:05,770 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-17 07:59:05,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:05,771 INFO L225 Difference]: With dead ends: 46 [2023-02-17 07:59:05,771 INFO L226 Difference]: Without dead ends: 29 [2023-02-17 07:59:05,772 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2023-02-17 07:59:05,773 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-17 07:59:05,773 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-17 07:59:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-02-17 07:59:05,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-02-17 07:59:05,778 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-17 07:59:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2023-02-17 07:59:05,779 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2023-02-17 07:59:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:05,779 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2023-02-17 07:59:05,780 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-17 07:59:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2023-02-17 07:59:05,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-17 07:59:05,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:05,782 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-17 07:59:05,793 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-17 07:59:05,993 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-17 07:59:05,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:05,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2023-02-17 07:59:05,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:05,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050305710] [2023-02-17 07:59:05,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:05,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:06,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:06,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,320 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-17 07:59:06,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:06,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050305710] [2023-02-17 07:59:06,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050305710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:06,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110772902] [2023-02-17 07:59:06,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:06,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:06,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:06,333 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-17 07:59:06,340 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-17 07:59:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:06,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-17 07:59:06,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:06,440 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-17 07:59:06,443 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:06,560 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-17 07:59:06,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110772902] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:06,562 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:06,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2023-02-17 07:59:06,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090004654] [2023-02-17 07:59:06,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:06,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-17 07:59:06,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:06,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-17 07:59:06,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2023-02-17 07:59:06,567 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-17 07:59:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:06,721 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2023-02-17 07:59:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-17 07:59:06,724 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-17 07:59:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:06,730 INFO L225 Difference]: With dead ends: 73 [2023-02-17 07:59:06,731 INFO L226 Difference]: Without dead ends: 44 [2023-02-17 07:59:06,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 134 SyntacticMatches, 7 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2023-02-17 07:59:06,735 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:06,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 93 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 07:59:06,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-02-17 07:59:06,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2023-02-17 07:59:06,745 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-17 07:59:06,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2023-02-17 07:59:06,747 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2023-02-17 07:59:06,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:06,747 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2023-02-17 07:59:06,748 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-17 07:59:06,748 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2023-02-17 07:59:06,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-02-17 07:59:06,753 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:06,753 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-17 07:59:06,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 07:59:06,961 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-17 07:59:06,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2023-02-17 07:59:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:06,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782694934] [2023-02-17 07:59:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-02-17 07:59:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-02-17 07:59:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:07,499 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-17 07:59:07,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:07,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782694934] [2023-02-17 07:59:07,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782694934] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:07,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598344143] [2023-02-17 07:59:07,502 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-17 07:59:07,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:07,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:07,503 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-17 07:59:07,517 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-17 07:59:07,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-17 07:59:07,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:07,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-17 07:59:07,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:07,665 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-17 07:59:07,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:07,854 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-17 07:59:07,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598344143] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:07,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:07,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2023-02-17 07:59:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195756508] [2023-02-17 07:59:07,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:07,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-17 07:59:07,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:07,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-17 07:59:07,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2023-02-17 07:59:07,859 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-17 07:59:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:08,205 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2023-02-17 07:59:08,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-17 07:59:08,206 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-17 07:59:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:08,207 INFO L225 Difference]: With dead ends: 119 [2023-02-17 07:59:08,207 INFO L226 Difference]: Without dead ends: 76 [2023-02-17 07:59:08,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 379 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2023-02-17 07:59:08,209 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 78 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:08,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 108 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 07:59:08,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-02-17 07:59:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2023-02-17 07:59:08,216 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-17 07:59:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2023-02-17 07:59:08,218 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2023-02-17 07:59:08,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:08,218 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2023-02-17 07:59:08,218 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-17 07:59:08,218 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2023-02-17 07:59:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2023-02-17 07:59:08,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:08,221 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-17 07:59:08,239 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-17 07:59:08,427 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-17 07:59:08,427 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:08,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:08,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2023-02-17 07:59:08,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:08,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606491399] [2023-02-17 07:59:08,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:08,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 07:59:08,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:08,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:09,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2023-02-17 07:59:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-02-17 07:59:09,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2023-02-17 07:59:09,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-02-17 07:59:09,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-02-17 07:59:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-02-17 07:59:09,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-02-17 07:59:09,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 07:59:09,512 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-17 07:59:09,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 07:59:09,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606491399] [2023-02-17 07:59:09,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606491399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 07:59:09,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364333097] [2023-02-17 07:59:09,513 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-17 07:59:09,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 07:59:09,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 07:59:09,533 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-17 07:59:09,534 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-17 07:59:09,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2023-02-17 07:59:09,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-17 07:59:09,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-17 07:59:09,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 07:59:09,710 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-17 07:59:09,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 07:59:09,902 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-17 07:59:09,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364333097] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 07:59:09,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 07:59:09,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2023-02-17 07:59:09,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231470647] [2023-02-17 07:59:09,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 07:59:09,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-02-17 07:59:09,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 07:59:09,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-02-17 07:59:09,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2023-02-17 07:59:09,906 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-17 07:59:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 07:59:10,236 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2023-02-17 07:59:10,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-17 07:59:10,237 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-17 07:59:10,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 07:59:10,250 INFO L225 Difference]: With dead ends: 172 [2023-02-17 07:59:10,250 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 07:59:10,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 774 SyntacticMatches, 21 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2023-02-17 07:59:10,254 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.2s IncrementalHoareTripleChecker+Time [2023-02-17 07:59:10,254 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.2s Time] [2023-02-17 07:59:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 07:59:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2023-02-17 07:59:10,276 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-17 07:59:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2023-02-17 07:59:10,278 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2023-02-17 07:59:10,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 07:59:10,296 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2023-02-17 07:59:10,296 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-17 07:59:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2023-02-17 07:59:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2023-02-17 07:59:10,306 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 07:59:10,307 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-17 07:59:10,315 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-17 07:59:10,513 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-17 07:59:10,513 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-02-17 07:59:10,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 07:59:10,515 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 4 times [2023-02-17 07:59:10,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 07:59:10,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7490729] [2023-02-17 07:59:10,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 07:59:10,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 07:59:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 07:59:10,575 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-17 07:59:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-17 07:59:10,682 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-02-17 07:59:10,682 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-17 07:59:10,683 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-02-17 07:59:10,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-17 07:59:10,687 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-02-17 07:59:10,692 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-17 07:59:10,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.02 07:59:10 BoogieIcfgContainer [2023-02-17 07:59:10,784 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-17 07:59:10,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-17 07:59:10,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-17 07:59:10,785 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-17 07:59:10,785 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 07:59:04" (3/4) ... [2023-02-17 07:59:10,786 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-17 07:59:10,865 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-17 07:59:10,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-17 07:59:10,866 INFO L158 Benchmark]: Toolchain (without parser) took 6523.78ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 99.6MB in the beginning and 144.5MB in the end (delta: -45.0MB). Peak memory consumption was 66.2MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,866 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 117.4MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:10,867 INFO L158 Benchmark]: CACSL2BoogieTranslator took 137.31ms. Allocated memory is still 146.8MB. Free memory was 99.1MB in the beginning and 89.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,867 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.73ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,867 INFO L158 Benchmark]: Boogie Preprocessor took 11.38ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 87.2MB in the end (delta: 920.7kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-17 07:59:10,867 INFO L158 Benchmark]: RCFGBuilder took 172.35ms. Allocated memory is still 146.8MB. Free memory was 87.0MB in the beginning and 77.7MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,868 INFO L158 Benchmark]: TraceAbstraction took 6095.56ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 76.7MB in the beginning and 154.0MB in the end (delta: -77.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,868 INFO L158 Benchmark]: Witness Printer took 81.44ms. Allocated memory is still 255.9MB. Free memory was 154.0MB in the beginning and 144.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-02-17 07:59:10,869 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.16ms. Allocated memory is still 117.4MB. Free memory is still 68.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 137.31ms. Allocated memory is still 146.8MB. Free memory was 99.1MB in the beginning and 89.3MB in the end (delta: 9.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.73ms. Allocated memory is still 146.8MB. Free memory was 89.3MB in the beginning and 88.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 11.38ms. Allocated memory is still 146.8MB. Free memory was 88.1MB in the beginning and 87.2MB in the end (delta: 920.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 172.35ms. Allocated memory is still 146.8MB. Free memory was 87.0MB in the beginning and 77.7MB in the end (delta: 9.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6095.56ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 76.7MB in the beginning and 154.0MB in the end (delta: -77.2MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Witness Printer took 81.44ms. Allocated memory is still 255.9MB. Free memory was 154.0MB in the beginning and 144.5MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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: 6.0s, OverallIterations: 7, TraceHistogramMax: 67, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 303 mSDsluCounter, 507 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 550 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1035 IncrementalHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 550 mSolverCounterUnsat, 103 mSDtfsCounter, 1035 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1518 GetRequests, 1338 SyntacticMatches, 41 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1525 ImplicationChecksByTransitivity, 0.8s 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.3s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 1701 NumberOfCodeBlocks, 1604 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 1837 ConstructedInterpolants, 0 QuantifiedInterpolants, 3639 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-17 07:59:10,901 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