./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 e19ca921 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-dev-e19ca92 [2021-12-22 11:38:58,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 11:38:58,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 11:38:58,342 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 11:38:58,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 11:38:58,346 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 11:38:58,347 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 11:38:58,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 11:38:58,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 11:38:58,356 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 11:38:58,357 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 11:38:58,358 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 11:38:58,359 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 11:38:58,361 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 11:38:58,362 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 11:38:58,365 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 11:38:58,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 11:38:58,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 11:38:58,369 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 11:38:58,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 11:38:58,375 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 11:38:58,376 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 11:38:58,378 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 11:38:58,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 11:38:58,384 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 11:38:58,384 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 11:38:58,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 11:38:58,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 11:38:58,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 11:38:58,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 11:38:58,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 11:38:58,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 11:38:58,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 11:38:58,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 11:38:58,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 11:38:58,392 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 11:38:58,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 11:38:58,392 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 11:38:58,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 11:38:58,394 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 11:38:58,395 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 11:38:58,396 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 11:38:58,426 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 11:38:58,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 11:38:58,427 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 11:38:58,427 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 11:38:58,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 11:38:58,428 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 11:38:58,429 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 11:38:58,429 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 11:38:58,429 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 11:38:58,430 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 11:38:58,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 11:38:58,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 11:38:58,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 11:38:58,431 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 11:38:58,431 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 11:38:58,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 11:38:58,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 11:38:58,432 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 11:38:58,432 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 11:38:58,432 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 11:38:58,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 11:38:58,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 11:38:58,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 11:38:58,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 11:38:58,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:38:58,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 11:38:58,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 11:38:58,435 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 11:38:58,435 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 11:38:58,435 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 11:38:58,435 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 11:38:58,435 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 11:38:58,436 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 11:38:58,436 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 11:38:58,436 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97829031814878890268a6b8dbba5c3e987e2ec78ab2dc94181f9e68090060bd [2021-12-22 11:38:58,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 11:38:58,703 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 11:38:58,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 11:38:58,706 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 11:38:58,707 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 11:38:58,709 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-22 11:38:58,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbeddaa7/81991f545edc46c1bb9186097a95d53d/FLAG2389404b0 [2021-12-22 11:38:59,118 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 11:38:59,119 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c [2021-12-22 11:38:59,124 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbeddaa7/81991f545edc46c1bb9186097a95d53d/FLAG2389404b0 [2021-12-22 11:38:59,553 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/afbeddaa7/81991f545edc46c1bb9186097a95d53d [2021-12-22 11:38:59,556 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 11:38:59,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 11:38:59,561 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 11:38:59,562 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 11:38:59,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 11:38:59,566 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,567 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f48b79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59, skipping insertion in model container [2021-12-22 11:38:59,567 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,573 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 11:38:59,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 11:38:59,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-22 11:38:59,784 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:38:59,794 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 11:38:59,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci05.c[746,759] [2021-12-22 11:38:59,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 11:38:59,822 INFO L208 MainTranslator]: Completed translation [2021-12-22 11:38:59,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59 WrapperNode [2021-12-22 11:38:59,823 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 11:38:59,824 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 11:38:59,824 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 11:38:59,825 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 11:38:59,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,851 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 23 [2021-12-22 11:38:59,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 11:38:59,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 11:38:59,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 11:38:59,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 11:38:59,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,865 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,867 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 11:38:59,872 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 11:38:59,872 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 11:38:59,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 11:38:59,873 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (1/1) ... [2021-12-22 11:38:59,879 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 11:38:59,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:38:59,941 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-22 11:38:59,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-22 11:38:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2021-12-22 11:38:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2021-12-22 11:38:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 11:38:59,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 11:38:59,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 11:38:59,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 11:39:00,034 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 11:39:00,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 11:39:00,173 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 11:39:00,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 11:39:00,186 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 11:39:00,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:39:00 BoogieIcfgContainer [2021-12-22 11:39:00,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 11:39:00,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 11:39:00,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 11:39:00,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 11:39:00,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 11:38:59" (1/3) ... [2021-12-22 11:39:00,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a9e472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:39:00, skipping insertion in model container [2021-12-22 11:39:00,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 11:38:59" (2/3) ... [2021-12-22 11:39:00,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76a9e472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 11:39:00, skipping insertion in model container [2021-12-22 11:39:00,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:39:00" (3/3) ... [2021-12-22 11:39:00,197 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2021-12-22 11:39:00,202 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 11:39:00,202 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-22 11:39:00,253 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 11:39:00,261 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-22 11:39:00,261 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-22 11:39:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-22 11:39:00,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-22 11:39:00,282 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:00,283 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:00,284 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:00,289 INFO L85 PathProgramCache]: Analyzing trace with hash 117289724, now seen corresponding path program 1 times [2021-12-22 11:39:00,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:00,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034577383] [2021-12-22 11:39:00,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:00,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:39:00,523 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:00,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034577383] [2021-12-22 11:39:00,524 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034577383] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:39:00,524 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:39:00,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:39:00,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026558843] [2021-12-22 11:39:00,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:39:00,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:39:00,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:39:00,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:39:00,554 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:39:00,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:00,639 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2021-12-22 11:39:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:39:00,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2021-12-22 11:39:00,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:00,662 INFO L225 Difference]: With dead ends: 31 [2021-12-22 11:39:00,662 INFO L226 Difference]: Without dead ends: 18 [2021-12-22 11:39:00,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:39:00,671 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 11 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:00,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:39:00,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-12-22 11:39:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-12-22 11:39:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-22 11:39:00,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-22 11:39:00,708 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2021-12-22 11:39:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:00,709 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-22 11:39:00,709 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:39:00,710 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-22 11:39:00,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-12-22 11:39:00,711 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:00,712 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:00,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 11:39:00,713 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:00,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 36927066, now seen corresponding path program 1 times [2021-12-22 11:39:00,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:00,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494313131] [2021-12-22 11:39:00,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:00,718 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:00,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 11:39:00,779 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:00,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494313131] [2021-12-22 11:39:00,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494313131] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 11:39:00,780 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 11:39:00,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-22 11:39:00,781 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815295098] [2021-12-22 11:39:00,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 11:39:00,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-22 11:39:00,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:00,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-22 11:39:00,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-22 11:39:00,785 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:39:00,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:00,826 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2021-12-22 11:39:00,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-22 11:39:00,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-12-22 11:39:00,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:00,828 INFO L225 Difference]: With dead ends: 24 [2021-12-22 11:39:00,828 INFO L226 Difference]: Without dead ends: 20 [2021-12-22 11:39:00,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-22 11:39:00,830 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:00,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 33 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-22 11:39:00,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-22 11:39:00,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2021-12-22 11:39:00,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2021-12-22 11:39:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2021-12-22 11:39:00,836 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2021-12-22 11:39:00,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:00,837 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2021-12-22 11:39:00,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-12-22 11:39:00,837 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2021-12-22 11:39:00,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-12-22 11:39:00,838 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:00,838 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:00,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 11:39:00,839 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:00,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:00,840 INFO L85 PathProgramCache]: Analyzing trace with hash 703243533, now seen corresponding path program 1 times [2021-12-22 11:39:00,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:00,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490760031] [2021-12-22 11:39:00,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:00,841 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2021-12-22 11:39:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,934 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 11:39:00,934 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:00,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490760031] [2021-12-22 11:39:00,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490760031] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:39:00,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137476417] [2021-12-22 11:39:00,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:00,935 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:00,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:39:00,938 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:39:00,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-22 11:39:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:00,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-22 11:39:00,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:39:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-22 11:39:01,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:39:01,278 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2021-12-22 11:39:01,278 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137476417] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:39:01,278 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:39:01,278 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 13 [2021-12-22 11:39:01,278 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118868565] [2021-12-22 11:39:01,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:39:01,279 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-22 11:39:01,279 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:01,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-22 11:39:01,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2021-12-22 11:39:01,281 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-22 11:39:01,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:01,450 INFO L93 Difference]: Finished difference Result 46 states and 69 transitions. [2021-12-22 11:39:01,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-22 11:39:01,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2021-12-22 11:39:01,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:01,453 INFO L225 Difference]: With dead ends: 46 [2021-12-22 11:39:01,453 INFO L226 Difference]: Without dead ends: 29 [2021-12-22 11:39:01,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=272, Unknown=0, NotChecked=0, Total=380 [2021-12-22 11:39:01,455 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:01,456 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 65 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:39:01,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-12-22 11:39:01,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-12-22 11:39:01,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2021-12-22 11:39:01,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2021-12-22 11:39:01,463 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 23 [2021-12-22 11:39:01,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:01,464 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2021-12-22 11:39:01,464 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 states have internal predecessors, (35), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2021-12-22 11:39:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2021-12-22 11:39:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-12-22 11:39:01,466 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:01,467 INFO L514 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:01,484 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-22 11:39:01,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:01,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:01,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1937134450, now seen corresponding path program 1 times [2021-12-22 11:39:01,672 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:01,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860870598] [2021-12-22 11:39:01,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:01,673 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:01,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:01,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:01,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 44 proven. 63 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2021-12-22 11:39:01,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:01,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860870598] [2021-12-22 11:39:01,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860870598] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:39:01,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089399024] [2021-12-22 11:39:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:01,974 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:01,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:39:01,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:39:02,015 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-22 11:39:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:02,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2021-12-22 11:39:02,077 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:39:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 75 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2021-12-22 11:39:02,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:39:02,612 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 82 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2021-12-22 11:39:02,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089399024] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:39:02,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:39:02,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 9] total 18 [2021-12-22 11:39:02,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214926856] [2021-12-22 11:39:02,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:39:02,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-12-22 11:39:02,616 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:02,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-12-22 11:39:02,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2021-12-22 11:39:02,620 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-22 11:39:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:02,863 INFO L93 Difference]: Finished difference Result 73 states and 123 transitions. [2021-12-22 11:39:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 11:39:02,864 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 65 [2021-12-22 11:39:02,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:02,869 INFO L225 Difference]: With dead ends: 73 [2021-12-22 11:39:02,869 INFO L226 Difference]: Without dead ends: 44 [2021-12-22 11:39:02,870 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=173, Invalid=427, Unknown=0, NotChecked=0, Total=600 [2021-12-22 11:39:02,873 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:02,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 94 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-22 11:39:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-12-22 11:39:02,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2021-12-22 11:39:02,883 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) [2021-12-22 11:39:02,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 66 transitions. [2021-12-22 11:39:02,885 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 66 transitions. Word has length 65 [2021-12-22 11:39:02,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:02,885 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 66 transitions. [2021-12-22 11:39:02,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 18 states have internal predecessors, (51), 11 states have call successors, (14), 1 states have call predecessors, (14), 7 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2021-12-22 11:39:02,886 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 66 transitions. [2021-12-22 11:39:02,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-22 11:39:02,891 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:02,891 INFO L514 BasicCegarLoop]: trace histogram [25, 25, 17, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:02,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-22 11:39:03,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2021-12-22 11:39:03,096 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1389805118, now seen corresponding path program 2 times [2021-12-22 11:39:03,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:03,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659913442] [2021-12-22 11:39:03,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:03,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:03,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:03,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:03,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-22 11:39:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:03,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2021-12-22 11:39:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:03,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-22 11:39:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:03,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2021-12-22 11:39:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:03,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:03,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 253 proven. 368 refuted. 0 times theorem prover too weak. 979 trivial. 0 not checked. [2021-12-22 11:39:03,509 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659913442] [2021-12-22 11:39:03,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659913442] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:39:03,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054496458] [2021-12-22 11:39:03,514 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-22 11:39:03,514 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:03,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:39:03,515 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:39:03,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-22 11:39:03,605 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-22 11:39:03,605 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:39:03,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-22 11:39:03,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:39:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 459 refuted. 0 times theorem prover too weak. 1074 trivial. 0 not checked. [2021-12-22 11:39:04,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:39:05,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 67 proven. 485 refuted. 0 times theorem prover too weak. 1048 trivial. 0 not checked. [2021-12-22 11:39:05,140 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054496458] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:39:05,140 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:39:05,140 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 13] total 23 [2021-12-22 11:39:05,140 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726153092] [2021-12-22 11:39:05,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:39:05,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2021-12-22 11:39:05,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-12-22 11:39:05,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2021-12-22 11:39:05,143 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) [2021-12-22 11:39:05,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:05,690 INFO L93 Difference]: Finished difference Result 119 states and 223 transitions. [2021-12-22 11:39:05,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-12-22 11:39:05,691 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 [2021-12-22 11:39:05,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:05,693 INFO L225 Difference]: With dead ends: 119 [2021-12-22 11:39:05,693 INFO L226 Difference]: Without dead ends: 76 [2021-12-22 11:39:05,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=515, Invalid=1291, Unknown=0, NotChecked=0, Total=1806 [2021-12-22 11:39:05,696 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 148 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:05,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 109 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-22 11:39:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2021-12-22 11:39:05,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 66. [2021-12-22 11:39:05,715 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) [2021-12-22 11:39:05,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 105 transitions. [2021-12-22 11:39:05,719 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 105 transitions. Word has length 171 [2021-12-22 11:39:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:05,719 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 105 transitions. [2021-12-22 11:39:05,719 INFO L471 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) [2021-12-22 11:39:05,720 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 105 transitions. [2021-12-22 11:39:05,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2021-12-22 11:39:05,725 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:05,725 INFO L514 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:05,748 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2021-12-22 11:39:05,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:05,940 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:05,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1020156483, now seen corresponding path program 3 times [2021-12-22 11:39:05,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:05,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034613863] [2021-12-22 11:39:05,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:05,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:06,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:39:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:39:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-22 11:39:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:06,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:39:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:39:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:06,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:06,803 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 844 proven. 1612 refuted. 0 times theorem prover too weak. 4664 trivial. 0 not checked. [2021-12-22 11:39:06,803 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:06,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034613863] [2021-12-22 11:39:06,803 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034613863] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:39:06,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348925193] [2021-12-22 11:39:06,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-22 11:39:06,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:06,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:39:06,808 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) [2021-12-22 11:39:06,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-22 11:39:06,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2021-12-22 11:39:06,972 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:39:06,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-22 11:39:06,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:39:07,588 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2021-12-22 11:39:07,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:39:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2021-12-22 11:39:09,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348925193] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:39:09,715 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:39:09,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 11, 17] total 33 [2021-12-22 11:39:09,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329953634] [2021-12-22 11:39:09,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:39:09,717 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2021-12-22 11:39:09,717 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:09,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-12-22 11:39:09,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=793, Unknown=0, NotChecked=0, Total=1056 [2021-12-22 11:39:09,720 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) [2021-12-22 11:39:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:10,215 INFO L93 Difference]: Finished difference Result 172 states and 339 transitions. [2021-12-22 11:39:10,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-22 11:39:10,216 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 [2021-12-22 11:39:10,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:10,219 INFO L225 Difference]: With dead ends: 172 [2021-12-22 11:39:10,219 INFO L226 Difference]: Without dead ends: 109 [2021-12-22 11:39:10,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 844 GetRequests, 794 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 725 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=654, Invalid=1896, Unknown=0, NotChecked=0, Total=2550 [2021-12-22 11:39:10,221 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 187 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 283 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 283 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:10,221 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 172 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [283 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-22 11:39:10,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-12-22 11:39:10,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2021-12-22 11:39:10,232 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) [2021-12-22 11:39:10,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 126 transitions. [2021-12-22 11:39:10,233 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 126 transitions. Word has length 351 [2021-12-22 11:39:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:10,234 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 126 transitions. [2021-12-22 11:39:10,235 INFO L471 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) [2021-12-22 11:39:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 126 transitions. [2021-12-22 11:39:10,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2021-12-22 11:39:10,243 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:10,243 INFO L514 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:10,270 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-22 11:39:10,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:10,468 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:10,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -4939658, now seen corresponding path program 4 times [2021-12-22 11:39:10,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:10,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652385628] [2021-12-22 11:39:10,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:10,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:10,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-22 11:39:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:10,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:39:11,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:39:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-22 11:39:11,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:39:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2021-12-22 11:39:11,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2021-12-22 11:39:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2021-12-22 11:39:11,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2021-12-22 11:39:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-22 11:39:11,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-22 11:39:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2021-12-22 11:39:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-22 11:39:11,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 11:39:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2818 proven. 2810 refuted. 0 times theorem prover too weak. 10779 trivial. 0 not checked. [2021-12-22 11:39:11,677 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 11:39:11,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652385628] [2021-12-22 11:39:11,677 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652385628] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-22 11:39:11,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550286831] [2021-12-22 11:39:11,677 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-22 11:39:11,677 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:11,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 11:39:11,678 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-22 11:39:11,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-22 11:39:11,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-22 11:39:11,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-22 11:39:11,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 937 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-22 11:39:11,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-22 11:39:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3346 refuted. 0 times theorem prover too weak. 11122 trivial. 0 not checked. [2021-12-22 11:39:12,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-22 11:39:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1939 proven. 3454 refuted. 0 times theorem prover too weak. 11014 trivial. 0 not checked. [2021-12-22 11:39:16,811 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550286831] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-22 11:39:16,812 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-22 11:39:16,812 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 31] total 45 [2021-12-22 11:39:16,812 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599230313] [2021-12-22 11:39:16,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-22 11:39:16,813 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2021-12-22 11:39:16,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 11:39:16,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2021-12-22 11:39:16,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=453, Invalid=1527, Unknown=0, NotChecked=0, Total=1980 [2021-12-22 11:39:16,815 INFO L87 Difference]: Start difference. First operand 91 states and 126 transitions. Second operand has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-22 11:39:17,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-22 11:39:17,609 INFO L93 Difference]: Finished difference Result 217 states and 398 transitions. [2021-12-22 11:39:17,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-12-22 11:39:17,609 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) Word has length 528 [2021-12-22 11:39:17,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-22 11:39:17,612 INFO L225 Difference]: With dead ends: 217 [2021-12-22 11:39:17,612 INFO L226 Difference]: Without dead ends: 129 [2021-12-22 11:39:17,614 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1269 GetRequests, 1197 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1575 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1241, Invalid=3871, Unknown=0, NotChecked=0, Total=5112 [2021-12-22 11:39:17,615 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 244 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 1266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-22 11:39:17,615 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 268 Invalid, 1266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2021-12-22 11:39:17,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2021-12-22 11:39:17,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 109. [2021-12-22 11:39:17,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 75 states have internal predecessors, (81), 21 states have call successors, (21), 17 states have call predecessors, (21), 9 states have return successors, (51), 16 states have call predecessors, (51), 21 states have call successors, (51) [2021-12-22 11:39:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 153 transitions. [2021-12-22 11:39:17,631 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 153 transitions. Word has length 528 [2021-12-22 11:39:17,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-22 11:39:17,632 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 153 transitions. [2021-12-22 11:39:17,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.688888888888889) internal successors, (121), 45 states have internal predecessors, (121), 39 states have call successors, (43), 1 states have call predecessors, (43), 16 states have return successors, (64), 26 states have call predecessors, (64), 39 states have call successors, (64) [2021-12-22 11:39:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 153 transitions. [2021-12-22 11:39:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2021-12-22 11:39:17,635 INFO L506 BasicCegarLoop]: Found error trace [2021-12-22 11:39:17,635 INFO L514 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 11:39:17,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-22 11:39:17,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-22 11:39:17,856 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-22 11:39:17,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 11:39:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 670316307, now seen corresponding path program 5 times [2021-12-22 11:39:17,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 11:39:17,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888962436] [2021-12-22 11:39:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 11:39:17,856 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 11:39:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:39:17,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 11:39:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 11:39:18,030 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 11:39:18,031 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 11:39:18,032 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-22 11:39:18,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 11:39:18,036 INFO L732 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1] [2021-12-22 11:39:18,041 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 11:39:18,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 11:39:18 BoogieIcfgContainer [2021-12-22 11:39:18,144 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 11:39:18,145 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 11:39:18,145 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 11:39:18,145 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 11:39:18,145 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 11:39:00" (3/4) ... [2021-12-22 11:39:18,147 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 11:39:18,211 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 11:39:18,211 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 11:39:18,212 INFO L158 Benchmark]: Toolchain (without parser) took 18654.47ms. Allocated memory was 102.8MB in the beginning and 262.1MB in the end (delta: 159.4MB). Free memory was 74.5MB in the beginning and 126.9MB in the end (delta: -52.4MB). Peak memory consumption was 105.2MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,212 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:39:18,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.90ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 79.5MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 102.8MB. Free memory was 79.5MB in the beginning and 78.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,213 INFO L158 Benchmark]: Boogie Preprocessor took 18.98ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 77.4MB in the end (delta: 785.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 11:39:18,213 INFO L158 Benchmark]: RCFGBuilder took 317.30ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 68.3MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,214 INFO L158 Benchmark]: TraceAbstraction took 17953.82ms. Allocated memory was 102.8MB in the beginning and 262.1MB in the end (delta: 159.4MB). Free memory was 68.1MB in the beginning and 137.4MB in the end (delta: -69.3MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,214 INFO L158 Benchmark]: Witness Printer took 67.10ms. Allocated memory is still 262.1MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-22 11:39:18,215 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.21ms. Allocated memory is still 102.8MB. Free memory was 59.8MB in the beginning and 59.7MB in the end (delta: 48.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.90ms. Allocated memory is still 102.8MB. Free memory was 74.3MB in the beginning and 79.5MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 102.8MB. Free memory was 79.5MB in the beginning and 78.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.98ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 77.4MB in the end (delta: 785.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 317.30ms. Allocated memory is still 102.8MB. Free memory was 77.1MB in the beginning and 68.3MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17953.82ms. Allocated memory was 102.8MB in the beginning and 262.1MB in the end (delta: 159.4MB). Free memory was 68.1MB in the beginning and 137.4MB in the end (delta: -69.3MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * Witness Printer took 67.10ms. Allocated memory is still 262.1MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 33]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] reach_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 8, TraceHistogramMax: 77, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 699 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 683 mSDsluCounter, 782 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 641 mSDsCounter, 1167 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1791 IncrementalHoareTripleChecker+Invalid, 2958 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1167 mSolverCounterUnsat, 141 mSDtfsCounter, 1791 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2787 GetRequests, 2573 SyntacticMatches, 5 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2730 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=7, InterpolantAutomatonStates: 139, 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, 7 MinimizatonAttempts, 50 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.9s InterpolantComputationTime, 2757 NumberOfCodeBlocks, 2580 NumberOfCodeBlocksAsserted, 41 NumberOfCheckSat, 3418 ConstructedInterpolants, 0 QuantifiedInterpolants, 5479 SizeOfPredicates, 31 NumberOfNonLiveVariables, 2170 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 60175/75984 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-22 11:39:18,259 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