./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/recursive/Fibonacci02.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version f4b24e32 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/Fibonacci02.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 13:51:58,305 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 13:51:58,307 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 13:51:58,348 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 13:51:58,349 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 13:51:58,350 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 13:51:58,352 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 13:51:58,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 13:51:58,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 13:51:58,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 13:51:58,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 13:51:58,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 13:51:58,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 13:51:58,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 13:51:58,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 13:51:58,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 13:51:58,372 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 13:51:58,373 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 13:51:58,375 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 13:51:58,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 13:51:58,381 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 13:51:58,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 13:51:58,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 13:51:58,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 13:51:58,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 13:51:58,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 13:51:58,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 13:51:58,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 13:51:58,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 13:51:58,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 13:51:58,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 13:51:58,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 13:51:58,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 13:51:58,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 13:51:58,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 13:51:58,398 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 13:51:58,398 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 13:51:58,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 13:51:58,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 13:51:58,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 13:51:58,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 13:51:58,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 13:51:58,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2022-07-14 13:51:58,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 13:51:58,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 13:51:58,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 13:51:58,442 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 13:51:58,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 13:51:58,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 13:51:58,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 13:51:58,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 13:51:58,443 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 13:51:58,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 13:51:58,444 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 13:51:58,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 13:51:58,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 13:51:58,446 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-07-14 13:51:58,446 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 13:51:58,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 13:51:58,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 13:51:58,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 13:51:58,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 13:51:58,447 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 13:51:58,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 13:51:58,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:51:58,448 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 13:51:58,448 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 13:51:58,448 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 13:51:58,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 13:51:58,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 13:51:58,449 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 13:51:58,449 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 ! overflow) ) 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 -> b7261cadd839cd02322bb28945f92ad1bd2170c0a65dd385996b5ff81cbb1de7 [2022-07-14 13:51:58,684 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 13:51:58,706 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 13:51:58,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 13:51:58,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 13:51:58,710 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 13:51:58,711 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci02.c [2022-07-14 13:51:58,778 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d33600/ee39a273930546ac848450a97b59f8f1/FLAGa27cf61d6 [2022-07-14 13:51:59,175 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 13:51:59,176 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci02.c [2022-07-14 13:51:59,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d33600/ee39a273930546ac848450a97b59f8f1/FLAGa27cf61d6 [2022-07-14 13:51:59,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/170d33600/ee39a273930546ac848450a97b59f8f1 [2022-07-14 13:51:59,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 13:51:59,598 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 13:51:59,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 13:51:59,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 13:51:59,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 13:51:59,604 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,605 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@900a5e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59, skipping insertion in model container [2022-07-14 13:51:59,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 13:51:59,624 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 13:51:59,749 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/Fibonacci02.c[715,728] [2022-07-14 13:51:59,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:51:59,758 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 13:51:59,768 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/Fibonacci02.c[715,728] [2022-07-14 13:51:59,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 13:51:59,778 INFO L208 MainTranslator]: Completed translation [2022-07-14 13:51:59,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59 WrapperNode [2022-07-14 13:51:59,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 13:51:59,780 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 13:51:59,780 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 13:51:59,780 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 13:51:59,785 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,803 INFO L137 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 21 [2022-07-14 13:51:59,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 13:51:59,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 13:51:59,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 13:51:59,804 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 13:51:59,810 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,812 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,816 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,817 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,818 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 13:51:59,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 13:51:59,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 13:51:59,819 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 13:51:59,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (1/1) ... [2022-07-14 13:51:59,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 13:51:59,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:51:59,857 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 13:51:59,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 13:51:59,890 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2022-07-14 13:51:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2022-07-14 13:51:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 13:51:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 13:51:59,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 13:51:59,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 13:51:59,938 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 13:51:59,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 13:52:00,084 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 13:52:00,089 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 13:52:00,089 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 13:52:00,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:52:00 BoogieIcfgContainer [2022-07-14 13:52:00,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 13:52:00,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 13:52:00,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 13:52:00,098 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 13:52:00,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 01:51:59" (1/3) ... [2022-07-14 13:52:00,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8aa389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:52:00, skipping insertion in model container [2022-07-14 13:52:00,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 01:51:59" (2/3) ... [2022-07-14 13:52:00,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8aa389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 01:52:00, skipping insertion in model container [2022-07-14 13:52:00,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:52:00" (3/3) ... [2022-07-14 13:52:00,102 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci02.c [2022-07-14 13:52:00,114 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 13:52:00,115 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-07-14 13:52:00,172 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 13:52:00,181 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f2f6589, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7ec2d8c1 [2022-07-14 13:52:00,182 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-07-14 13:52:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 13:52:00,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 13:52:00,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:00,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:00,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:00,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash -108718961, now seen corresponding path program 1 times [2022-07-14 13:52:00,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:00,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14683794] [2022-07-14 13:52:00,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:00,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:52:00,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:00,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14683794] [2022-07-14 13:52:00,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14683794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:00,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:52:00,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:52:00,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233031080] [2022-07-14 13:52:00,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:00,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:52:00,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:00,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:52:00,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:00,475 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.4736842105263157) internal successors, (28), 25 states have internal predecessors, (28), 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, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:52:00,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:00,555 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-14 13:52:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:52:00,557 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 13:52:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:00,562 INFO L225 Difference]: With dead ends: 33 [2022-07-14 13:52:00,563 INFO L226 Difference]: Without dead ends: 22 [2022-07-14 13:52:00,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 13:52:00,568 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 38 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:00,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 39 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:00,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-14 13:52:00,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-14 13:52:00,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 18 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:00,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-14 13:52:00,611 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 7 [2022-07-14 13:52:00,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:00,611 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-14 13:52:00,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:52:00,612 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-14 13:52:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 13:52:00,614 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:00,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:00,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 13:52:00,615 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:00,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 924679547, now seen corresponding path program 1 times [2022-07-14 13:52:00,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:00,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27759986] [2022-07-14 13:52:00,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:00,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:52:00,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:00,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27759986] [2022-07-14 13:52:00,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27759986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:00,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:52:00,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 13:52:00,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189661045] [2022-07-14 13:52:00,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:00,668 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 13:52:00,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:00,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 13:52:00,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:52:00,671 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:52:00,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:00,690 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-07-14 13:52:00,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 13:52:00,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 13:52:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:00,693 INFO L225 Difference]: With dead ends: 24 [2022-07-14 13:52:00,693 INFO L226 Difference]: Without dead ends: 22 [2022-07-14 13:52:00,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 13:52:00,695 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 11 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:00,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:00,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-14 13:52:00,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2022-07-14 13:52:00,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-14 13:52:00,702 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 8 [2022-07-14 13:52:00,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:00,702 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-14 13:52:00,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:52:00,703 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-14 13:52:00,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 13:52:00,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:00,704 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:00,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 13:52:00,704 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:00,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:00,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1244761165, now seen corresponding path program 1 times [2022-07-14 13:52:00,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:00,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884420980] [2022-07-14 13:52:00,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:00,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 13:52:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 13:52:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,791 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-07-14 13:52:00,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:00,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884420980] [2022-07-14 13:52:00,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884420980] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:00,792 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:52:00,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:52:00,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112895818] [2022-07-14 13:52:00,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:00,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:52:00,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:52:00,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:00,794 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:00,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:00,839 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-14 13:52:00,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:52:00,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-07-14 13:52:00,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:00,842 INFO L225 Difference]: With dead ends: 36 [2022-07-14 13:52:00,842 INFO L226 Difference]: Without dead ends: 34 [2022-07-14 13:52:00,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:00,846 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:00,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 64 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-14 13:52:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-07-14 13:52:00,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 23 states have internal predecessors, (25), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 13:52:00,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-07-14 13:52:00,864 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 23 [2022-07-14 13:52:00,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:00,864 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-07-14 13:52:00,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:00,864 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-07-14 13:52:00,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 13:52:00,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:00,866 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:00,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 13:52:00,866 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:00,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:00,867 INFO L85 PathProgramCache]: Analyzing trace with hash 78572347, now seen corresponding path program 1 times [2022-07-14 13:52:00,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:00,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606951672] [2022-07-14 13:52:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:00,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 13:52:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 13:52:00,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:00,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-14 13:52:00,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:00,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606951672] [2022-07-14 13:52:00,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606951672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:00,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663304208] [2022-07-14 13:52:00,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:00,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:00,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:00,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:00,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 13:52:01,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:01,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 13:52:01,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:52:01,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:52:01,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663304208] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:01,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:01,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 15 [2022-07-14 13:52:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81026506] [2022-07-14 13:52:01,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:01,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 13:52:01,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 13:52:01,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-14 13:52:01,262 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 13:52:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:01,628 INFO L93 Difference]: Finished difference Result 126 states and 172 transitions. [2022-07-14 13:52:01,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 13:52:01,629 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 24 [2022-07-14 13:52:01,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:01,630 INFO L225 Difference]: With dead ends: 126 [2022-07-14 13:52:01,631 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 13:52:01,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-07-14 13:52:01,633 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 120 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:01,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 135 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:52:01,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 13:52:01,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-07-14 13:52:01,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.1129032258064515) internal successors, (69), 64 states have internal predecessors, (69), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 13 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-14 13:52:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2022-07-14 13:52:01,656 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 24 [2022-07-14 13:52:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:01,656 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2022-07-14 13:52:01,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 13 states have internal predecessors, (44), 7 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 13:52:01,657 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2022-07-14 13:52:01,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 13:52:01,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:01,658 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:01,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:01,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:01,864 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:01,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:01,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1267704266, now seen corresponding path program 2 times [2022-07-14 13:52:01,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:01,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285776530] [2022-07-14 13:52:01,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:01,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:01,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:01,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:01,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 13:52:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:01,962 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:52:01,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:01,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285776530] [2022-07-14 13:52:01,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285776530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:01,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002349914] [2022-07-14 13:52:01,963 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:52:01,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:01,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:01,965 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:01,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 13:52:01,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:52:01,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:01,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 13:52:02,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:52:02,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:52:02,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002349914] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:02,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:52:02,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2022-07-14 13:52:02,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726430547] [2022-07-14 13:52:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:02,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:52:02,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:02,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:52:02,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:52:02,048 INFO L87 Difference]: Start difference. First operand 81 states and 112 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:02,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:02,083 INFO L93 Difference]: Finished difference Result 95 states and 128 transitions. [2022-07-14 13:52:02,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:52:02,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-14 13:52:02,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:02,086 INFO L225 Difference]: With dead ends: 95 [2022-07-14 13:52:02,086 INFO L226 Difference]: Without dead ends: 94 [2022-07-14 13:52:02,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-14 13:52:02,088 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:02,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-14 13:52:02,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 85. [2022-07-14 13:52:02,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 11 states have call successors, (11), 3 states have call predecessors, (11), 6 states have return successors, (32), 15 states have call predecessors, (32), 10 states have call successors, (32) [2022-07-14 13:52:02,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2022-07-14 13:52:02,113 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 30 [2022-07-14 13:52:02,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:02,113 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2022-07-14 13:52:02,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:02,113 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2022-07-14 13:52:02,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 13:52:02,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:02,114 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:02,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:02,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:02,315 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:02,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash -644126528, now seen corresponding path program 1 times [2022-07-14 13:52:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:02,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986383957] [2022-07-14 13:52:02,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:02,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:02,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-14 13:52:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-14 13:52:02,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:02,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986383957] [2022-07-14 13:52:02,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986383957] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:02,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319666385] [2022-07-14 13:52:02,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:02,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:02,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:02,396 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:02,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 13:52:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:02,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 13:52:02,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 13:52:02,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:02,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 13:52:02,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319666385] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:02,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:02,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2022-07-14 13:52:02,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227877545] [2022-07-14 13:52:02,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:02,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:52:02,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:02,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:52:02,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:52:02,695 INFO L87 Difference]: Start difference. First operand 85 states and 116 transitions. Second operand has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 13:52:03,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:03,366 INFO L93 Difference]: Finished difference Result 287 states and 442 transitions. [2022-07-14 13:52:03,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 13:52:03,367 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) Word has length 31 [2022-07-14 13:52:03,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:03,370 INFO L225 Difference]: With dead ends: 287 [2022-07-14 13:52:03,370 INFO L226 Difference]: Without dead ends: 211 [2022-07-14 13:52:03,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2022-07-14 13:52:03,373 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 168 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:03,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 326 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 13:52:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-14 13:52:03,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 175. [2022-07-14 13:52:03,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 137 states have (on average 1.094890510948905) internal successors, (150), 137 states have internal predecessors, (150), 22 states have call successors, (22), 6 states have call predecessors, (22), 14 states have return successors, (83), 31 states have call predecessors, (83), 21 states have call successors, (83) [2022-07-14 13:52:03,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 255 transitions. [2022-07-14 13:52:03,403 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 255 transitions. Word has length 31 [2022-07-14 13:52:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:03,404 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 255 transitions. [2022-07-14 13:52:03,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 15 states have internal predecessors, (57), 9 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (6), 3 states have call predecessors, (6), 5 states have call successors, (6) [2022-07-14 13:52:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 255 transitions. [2022-07-14 13:52:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 13:52:03,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:03,406 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:03,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:03,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:03,612 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:03,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:03,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1089076188, now seen corresponding path program 1 times [2022-07-14 13:52:03,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:03,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239293860] [2022-07-14 13:52:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:52:03,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 13:52:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,694 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-14 13:52:03,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:03,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239293860] [2022-07-14 13:52:03,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239293860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:03,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:52:03,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:52:03,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728991275] [2022-07-14 13:52:03,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:03,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:52:03,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:03,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:52:03,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:03,697 INFO L87 Difference]: Start difference. First operand 175 states and 255 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:03,746 INFO L93 Difference]: Finished difference Result 192 states and 278 transitions. [2022-07-14 13:52:03,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:52:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-14 13:52:03,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:03,757 INFO L225 Difference]: With dead ends: 192 [2022-07-14 13:52:03,758 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 13:52:03,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:03,759 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 5 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:03,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 13:52:03,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2022-07-14 13:52:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.0909090909090908) internal successors, (156), 142 states have internal predecessors, (156), 23 states have call successors, (23), 6 states have call predecessors, (23), 14 states have return successors, (89), 33 states have call predecessors, (89), 22 states have call successors, (89) [2022-07-14 13:52:03,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 268 transitions. [2022-07-14 13:52:03,787 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 268 transitions. Word has length 55 [2022-07-14 13:52:03,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:03,787 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 268 transitions. [2022-07-14 13:52:03,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 13:52:03,788 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 268 transitions. [2022-07-14 13:52:03,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-14 13:52:03,791 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:03,791 INFO L195 NwaCegarLoop]: trace histogram [11, 9, 7, 7, 7, 7, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:03,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 13:52:03,792 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1167140976, now seen corresponding path program 1 times [2022-07-14 13:52:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:03,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558686803] [2022-07-14 13:52:03,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:03,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 13:52:03,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-14 13:52:03,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-14 13:52:03,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:03,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,867 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-07-14 13:52:03,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558686803] [2022-07-14 13:52:03,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558686803] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145500453] [2022-07-14 13:52:03,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:03,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:03,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:03,869 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:03,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 13:52:03,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:03,917 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 13:52:03,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:04,081 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 116 proven. 75 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-14 13:52:04,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:04,259 INFO L134 CoverageAnalysis]: Checked inductivity of 243 backedges. 35 proven. 175 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-14 13:52:04,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145500453] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:04,259 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:04,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 15, 15] total 24 [2022-07-14 13:52:04,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492804642] [2022-07-14 13:52:04,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:04,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 13:52:04,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:04,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 13:52:04,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2022-07-14 13:52:04,265 INFO L87 Difference]: Start difference. First operand 182 states and 268 transitions. Second operand has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-14 13:52:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:04,792 INFO L93 Difference]: Finished difference Result 497 states and 797 transitions. [2022-07-14 13:52:04,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 13:52:04,793 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) Word has length 82 [2022-07-14 13:52:04,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:04,796 INFO L225 Difference]: With dead ends: 497 [2022-07-14 13:52:04,796 INFO L226 Difference]: Without dead ends: 330 [2022-07-14 13:52:04,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=963, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 13:52:04,799 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 243 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:04,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 443 Invalid, 727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 13:52:04,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-14 13:52:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 302. [2022-07-14 13:52:04,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 238 states have (on average 1.096638655462185) internal successors, (261), 237 states have internal predecessors, (261), 38 states have call successors, (38), 11 states have call predecessors, (38), 24 states have return successors, (115), 53 states have call predecessors, (115), 37 states have call successors, (115) [2022-07-14 13:52:04,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 414 transitions. [2022-07-14 13:52:04,832 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 414 transitions. Word has length 82 [2022-07-14 13:52:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:04,833 INFO L495 AbstractCegarLoop]: Abstraction has 302 states and 414 transitions. [2022-07-14 13:52:04,833 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 3.727272727272727) internal successors, (82), 17 states have internal predecessors, (82), 12 states have call successors, (18), 9 states have call predecessors, (18), 4 states have return successors, (10), 3 states have call predecessors, (10), 5 states have call successors, (10) [2022-07-14 13:52:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 414 transitions. [2022-07-14 13:52:04,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-14 13:52:04,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:04,842 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 10, 10, 10, 10, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-07-14 13:52:04,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:05,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:05,043 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:05,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:05,044 INFO L85 PathProgramCache]: Analyzing trace with hash -753402631, now seen corresponding path program 1 times [2022-07-14 13:52:05,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:05,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498070400] [2022-07-14 13:52:05,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:05,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:05,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 13:52:05,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-14 13:52:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 13:52:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:05,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:05,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,155 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-07-14 13:52:05,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498070400] [2022-07-14 13:52:05,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498070400] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1840412525] [2022-07-14 13:52:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:05,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:05,159 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:05,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 13:52:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:05,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 13:52:05,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 178 proven. 184 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-07-14 13:52:05,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:05,590 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 53 proven. 330 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-14 13:52:05,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1840412525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:05,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:05,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 21, 21] total 25 [2022-07-14 13:52:05,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336961692] [2022-07-14 13:52:05,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:05,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 13:52:05,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:05,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 13:52:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2022-07-14 13:52:05,596 INFO L87 Difference]: Start difference. First operand 302 states and 414 transitions. Second operand has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-14 13:52:06,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:06,154 INFO L93 Difference]: Finished difference Result 643 states and 932 transitions. [2022-07-14 13:52:06,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 13:52:06,154 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 101 [2022-07-14 13:52:06,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:06,158 INFO L225 Difference]: With dead ends: 643 [2022-07-14 13:52:06,159 INFO L226 Difference]: Without dead ends: 362 [2022-07-14 13:52:06,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=996, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 13:52:06,166 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 264 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:06,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 486 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 13:52:06,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2022-07-14 13:52:06,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 325. [2022-07-14 13:52:06,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 256 states have (on average 1.09765625) internal successors, (281), 255 states have internal predecessors, (281), 42 states have call successors, (42), 12 states have call predecessors, (42), 25 states have return successors, (117), 57 states have call predecessors, (117), 41 states have call successors, (117) [2022-07-14 13:52:06,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 440 transitions. [2022-07-14 13:52:06,211 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 440 transitions. Word has length 101 [2022-07-14 13:52:06,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:06,212 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 440 transitions. [2022-07-14 13:52:06,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.5416666666666665) internal successors, (85), 17 states have internal predecessors, (85), 12 states have call successors, (17), 10 states have call predecessors, (17), 4 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-07-14 13:52:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 440 transitions. [2022-07-14 13:52:06,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-14 13:52:06,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:06,217 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 9, 9, 9, 9, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:06,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:06,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:06,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:06,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -147621069, now seen corresponding path program 2 times [2022-07-14 13:52:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:06,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447384911] [2022-07-14 13:52:06,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:06,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:06,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 13:52:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:06,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-14 13:52:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 13:52:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:06,706 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:52:06,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447384911] [2022-07-14 13:52:06,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447384911] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:06,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561458609] [2022-07-14 13:52:06,707 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 13:52:06,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:06,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:06,708 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:06,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 13:52:06,752 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 13:52:06,753 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:06,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 13:52:06,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:06,856 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:52:06,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 178 proven. 119 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-14 13:52:07,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561458609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:07,014 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:07,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 24 [2022-07-14 13:52:07,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412599943] [2022-07-14 13:52:07,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:07,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 13:52:07,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:07,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 13:52:07,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2022-07-14 13:52:07,018 INFO L87 Difference]: Start difference. First operand 325 states and 440 transitions. Second operand has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 13:52:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:07,478 INFO L93 Difference]: Finished difference Result 618 states and 883 transitions. [2022-07-14 13:52:07,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 13:52:07,479 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 86 [2022-07-14 13:52:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:07,481 INFO L225 Difference]: With dead ends: 618 [2022-07-14 13:52:07,482 INFO L226 Difference]: Without dead ends: 314 [2022-07-14 13:52:07,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=1119, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 13:52:07,486 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 461 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:07,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 137 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:52:07,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2022-07-14 13:52:07,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 288. [2022-07-14 13:52:07,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.092920353982301) internal successors, (247), 228 states have internal predecessors, (247), 37 states have call successors, (37), 12 states have call predecessors, (37), 23 states have return successors, (68), 47 states have call predecessors, (68), 36 states have call successors, (68) [2022-07-14 13:52:07,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 352 transitions. [2022-07-14 13:52:07,502 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 352 transitions. Word has length 86 [2022-07-14 13:52:07,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:07,503 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 352 transitions. [2022-07-14 13:52:07,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.217391304347826) internal successors, (74), 16 states have internal predecessors, (74), 11 states have call successors, (14), 9 states have call predecessors, (14), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2022-07-14 13:52:07,503 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 352 transitions. [2022-07-14 13:52:07,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-14 13:52:07,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:07,505 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:07,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:07,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:07,728 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:07,728 INFO L85 PathProgramCache]: Analyzing trace with hash 208625464, now seen corresponding path program 3 times [2022-07-14 13:52:07,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:07,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873405661] [2022-07-14 13:52:07,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:07,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:07,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 13:52:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:07,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:07,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 13:52:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-14 13:52:07,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:07,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873405661] [2022-07-14 13:52:07,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873405661] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:07,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139359739] [2022-07-14 13:52:07,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:52:07,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:07,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:07,807 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:07,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 13:52:07,852 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-14 13:52:07,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:07,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 13:52:07,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2022-07-14 13:52:07,903 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2022-07-14 13:52:08,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139359739] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:08,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:08,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 13 [2022-07-14 13:52:08,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697323878] [2022-07-14 13:52:08,031 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:08,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 13:52:08,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:08,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 13:52:08,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2022-07-14 13:52:08,032 INFO L87 Difference]: Start difference. First operand 288 states and 352 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-14 13:52:08,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:08,121 INFO L93 Difference]: Finished difference Result 297 states and 362 transitions. [2022-07-14 13:52:08,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 13:52:08,121 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) Word has length 80 [2022-07-14 13:52:08,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:08,123 INFO L225 Difference]: With dead ends: 297 [2022-07-14 13:52:08,123 INFO L226 Difference]: Without dead ends: 296 [2022-07-14 13:52:08,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-07-14 13:52:08,124 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 18 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:08,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 141 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:08,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-07-14 13:52:08,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 288. [2022-07-14 13:52:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 226 states have (on average 1.084070796460177) internal successors, (245), 228 states have internal predecessors, (245), 37 states have call successors, (37), 12 states have call predecessors, (37), 23 states have return successors, (68), 47 states have call predecessors, (68), 36 states have call successors, (68) [2022-07-14 13:52:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 350 transitions. [2022-07-14 13:52:08,139 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 350 transitions. Word has length 80 [2022-07-14 13:52:08,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:08,139 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 350 transitions. [2022-07-14 13:52:08,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (8), 8 states have call predecessors, (8), 3 states have call successors, (8) [2022-07-14 13:52:08,140 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 350 transitions. [2022-07-14 13:52:08,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-14 13:52:08,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:08,141 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 8, 8, 8, 8, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-07-14 13:52:08,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:08,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:08,364 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -2122545154, now seen corresponding path program 2 times [2022-07-14 13:52:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983554475] [2022-07-14 13:52:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:08,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 13:52:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:08,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 13:52:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2022-07-14 13:52:08,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:08,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983554475] [2022-07-14 13:52:08,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983554475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:08,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 13:52:08,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 13:52:08,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347541672] [2022-07-14 13:52:08,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:08,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 13:52:08,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:08,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 13:52:08,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:08,421 INFO L87 Difference]: Start difference. First operand 288 states and 350 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 13:52:08,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:08,449 INFO L93 Difference]: Finished difference Result 296 states and 361 transitions. [2022-07-14 13:52:08,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 13:52:08,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 81 [2022-07-14 13:52:08,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:08,451 INFO L225 Difference]: With dead ends: 296 [2022-07-14 13:52:08,452 INFO L226 Difference]: Without dead ends: 295 [2022-07-14 13:52:08,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 13:52:08,453 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:08,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 66 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-07-14 13:52:08,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2022-07-14 13:52:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.0826086956521739) internal successors, (249), 232 states have internal predecessors, (249), 37 states have call successors, (37), 12 states have call predecessors, (37), 24 states have return successors, (72), 48 states have call predecessors, (72), 36 states have call successors, (72) [2022-07-14 13:52:08,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 358 transitions. [2022-07-14 13:52:08,469 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 358 transitions. Word has length 81 [2022-07-14 13:52:08,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:08,469 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 358 transitions. [2022-07-14 13:52:08,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-14 13:52:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 358 transitions. [2022-07-14 13:52:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-14 13:52:08,472 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:08,472 INFO L195 NwaCegarLoop]: trace histogram [13, 10, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2022-07-14 13:52:08,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 13:52:08,473 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:08,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:08,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1583653005, now seen corresponding path program 3 times [2022-07-14 13:52:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:08,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012663423] [2022-07-14 13:52:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 13:52:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 13:52:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:08,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 13:52:08,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:08,725 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 168 proven. 157 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-14 13:52:08,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012663423] [2022-07-14 13:52:08,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012663423] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:08,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937695803] [2022-07-14 13:52:08,726 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 13:52:08,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:08,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:08,727 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:08,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 13:52:08,768 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 13:52:08,768 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:08,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 13:52:08,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:08,853 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-07-14 13:52:08,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 13:52:08,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937695803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 13:52:08,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 13:52:08,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [22] total 25 [2022-07-14 13:52:08,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523464653] [2022-07-14 13:52:08,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 13:52:08,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 13:52:08,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:08,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 13:52:08,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2022-07-14 13:52:08,856 INFO L87 Difference]: Start difference. First operand 293 states and 358 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 13:52:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:08,908 INFO L93 Difference]: Finished difference Result 462 states and 592 transitions. [2022-07-14 13:52:08,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 13:52:08,908 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 99 [2022-07-14 13:52:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:08,910 INFO L225 Difference]: With dead ends: 462 [2022-07-14 13:52:08,910 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 13:52:08,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 108 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=625, Unknown=0, NotChecked=0, Total=756 [2022-07-14 13:52:08,913 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 38 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:08,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 32 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:08,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 13:52:08,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2022-07-14 13:52:08,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 150 states have (on average 1.1266666666666667) internal successors, (169), 152 states have internal predecessors, (169), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (27), 25 states have call predecessors, (27), 24 states have call successors, (27) [2022-07-14 13:52:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 221 transitions. [2022-07-14 13:52:08,923 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 221 transitions. Word has length 99 [2022-07-14 13:52:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:08,924 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 221 transitions. [2022-07-14 13:52:08,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-14 13:52:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 221 transitions. [2022-07-14 13:52:08,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-14 13:52:08,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:08,925 INFO L195 NwaCegarLoop]: trace histogram [13, 11, 9, 9, 9, 9, 6, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2022-07-14 13:52:08,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:09,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-07-14 13:52:09,140 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:09,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:09,140 INFO L85 PathProgramCache]: Analyzing trace with hash -120532817, now seen corresponding path program 4 times [2022-07-14 13:52:09,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:09,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012321992] [2022-07-14 13:52:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:09,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 13:52:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 13:52:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:09,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:09,350 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 161 proven. 161 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-07-14 13:52:09,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:09,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012321992] [2022-07-14 13:52:09,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012321992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:09,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390811255] [2022-07-14 13:52:09,351 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:52:09,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:09,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:09,352 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:09,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 13:52:09,393 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:52:09,393 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:09,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 13:52:09,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:09,492 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 172 proven. 163 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-07-14 13:52:09,493 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 172 proven. 164 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-07-14 13:52:09,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390811255] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:09,732 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:09,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 21] total 25 [2022-07-14 13:52:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519265767] [2022-07-14 13:52:09,732 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:09,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 13:52:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 13:52:09,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=490, Unknown=0, NotChecked=0, Total=600 [2022-07-14 13:52:09,734 INFO L87 Difference]: Start difference. First operand 190 states and 221 transitions. Second operand has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-14 13:52:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:10,241 INFO L93 Difference]: Finished difference Result 375 states and 442 transitions. [2022-07-14 13:52:10,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 13:52:10,242 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) Word has length 100 [2022-07-14 13:52:10,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:10,243 INFO L225 Difference]: With dead ends: 375 [2022-07-14 13:52:10,244 INFO L226 Difference]: Without dead ends: 206 [2022-07-14 13:52:10,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=673, Invalid=1877, Unknown=0, NotChecked=0, Total=2550 [2022-07-14 13:52:10,246 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 489 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:10,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 129 Invalid, 500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 13:52:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-07-14 13:52:10,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 189. [2022-07-14 13:52:10,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 149 states have (on average 1.1208053691275168) internal successors, (167), 151 states have internal predecessors, (167), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-14 13:52:10,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 218 transitions. [2022-07-14 13:52:10,255 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 218 transitions. Word has length 100 [2022-07-14 13:52:10,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:10,256 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 218 transitions. [2022-07-14 13:52:10,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.625) internal successors, (87), 18 states have internal predecessors, (87), 13 states have call successors, (16), 8 states have call predecessors, (16), 3 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2022-07-14 13:52:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 218 transitions. [2022-07-14 13:52:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-14 13:52:10,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:10,257 INFO L195 NwaCegarLoop]: trace histogram [14, 12, 9, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1] [2022-07-14 13:52:10,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:10,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 13:52:10,471 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:10,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:10,472 INFO L85 PathProgramCache]: Analyzing trace with hash -284873213, now seen corresponding path program 5 times [2022-07-14 13:52:10,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:10,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942374992] [2022-07-14 13:52:10,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:10,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 13:52:10,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:10,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:10,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:10,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:10,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 13:52:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:10,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:10,581 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 393 trivial. 0 not checked. [2022-07-14 13:52:10,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942374992] [2022-07-14 13:52:10,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942374992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:10,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697835732] [2022-07-14 13:52:10,582 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:52:10,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:10,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:10,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:10,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 13:52:10,661 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2022-07-14 13:52:10,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:10,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 13:52:10,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 26 proven. 56 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-07-14 13:52:10,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:11,048 INFO L134 CoverageAnalysis]: Checked inductivity of 454 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2022-07-14 13:52:11,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697835732] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:11,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:11,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-07-14 13:52:11,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593397145] [2022-07-14 13:52:11,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:11,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 13:52:11,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:11,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 13:52:11,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2022-07-14 13:52:11,051 INFO L87 Difference]: Start difference. First operand 189 states and 218 transitions. Second operand has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 13:52:11,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:11,120 INFO L93 Difference]: Finished difference Result 189 states and 218 transitions. [2022-07-14 13:52:11,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 13:52:11,120 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) Word has length 114 [2022-07-14 13:52:11,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:11,122 INFO L225 Difference]: With dead ends: 189 [2022-07-14 13:52:11,122 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 13:52:11,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2022-07-14 13:52:11,123 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:11,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 138 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 13:52:11,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 13:52:11,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 13:52:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0608108108108107) internal successors, (157), 149 states have internal predecessors, (157), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-14 13:52:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 208 transitions. [2022-07-14 13:52:11,132 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 208 transitions. Word has length 114 [2022-07-14 13:52:11,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:11,132 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 208 transitions. [2022-07-14 13:52:11,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.4444444444444446) internal successors, (62), 19 states have internal predecessors, (62), 5 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (15), 12 states have call predecessors, (15), 5 states have call successors, (15) [2022-07-14 13:52:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 208 transitions. [2022-07-14 13:52:11,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-14 13:52:11,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:11,134 INFO L195 NwaCegarLoop]: trace histogram [19, 16, 14, 11, 11, 11, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 3, 1, 1, 1, 1] [2022-07-14 13:52:11,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:11,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 13:52:11,347 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:11,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1425556519, now seen corresponding path program 4 times [2022-07-14 13:52:11,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:11,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834969612] [2022-07-14 13:52:11,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:11,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 13:52:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:11,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:11,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:11,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 13:52:11,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:11,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:11,562 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2022-07-14 13:52:11,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:11,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834969612] [2022-07-14 13:52:11,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834969612] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:11,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223023803] [2022-07-14 13:52:11,563 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 13:52:11,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:11,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:11,564 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:11,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 13:52:11,638 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 13:52:11,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:11,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 13:52:11,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:11,797 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 78 proven. 129 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2022-07-14 13:52:11,797 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:12,656 INFO L134 CoverageAnalysis]: Checked inductivity of 950 backedges. 144 proven. 122 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-07-14 13:52:12,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223023803] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:12,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:12,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 17] total 26 [2022-07-14 13:52:12,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238982206] [2022-07-14 13:52:12,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:12,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 13:52:12,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:12,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 13:52:12,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2022-07-14 13:52:12,659 INFO L87 Difference]: Start difference. First operand 187 states and 208 transitions. Second operand has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-07-14 13:52:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:12,727 INFO L93 Difference]: Finished difference Result 188 states and 208 transitions. [2022-07-14 13:52:12,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 13:52:12,728 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) Word has length 166 [2022-07-14 13:52:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:12,729 INFO L225 Difference]: With dead ends: 188 [2022-07-14 13:52:12,729 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 13:52:12,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2022-07-14 13:52:12,730 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:12,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 160 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:52:12,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 13:52:12,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 13:52:12,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0337837837837838) internal successors, (153), 149 states have internal predecessors, (153), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-14 13:52:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-07-14 13:52:12,739 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 166 [2022-07-14 13:52:12,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:12,739 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-07-14 13:52:12,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.6153846153846154) internal successors, (68), 27 states have internal predecessors, (68), 7 states have call successors, (8), 1 states have call predecessors, (8), 7 states have return successors, (18), 18 states have call predecessors, (18), 7 states have call successors, (18) [2022-07-14 13:52:12,740 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-07-14 13:52:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2022-07-14 13:52:12,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:12,744 INFO L195 NwaCegarLoop]: trace histogram [43, 40, 35, 22, 22, 22, 22, 20, 20, 20, 20, 20, 20, 20, 19, 19, 13, 8, 1, 1, 1, 1] [2022-07-14 13:52:12,770 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:12,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 13:52:12,968 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:12,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:12,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1446613788, now seen corresponding path program 5 times [2022-07-14 13:52:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:12,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029556745] [2022-07-14 13:52:12,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:12,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 13:52:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:13,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 13:52:13,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:13,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-07-14 13:52:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:13,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:13,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:13,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:13,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2022-07-14 13:52:13,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029556745] [2022-07-14 13:52:13,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029556745] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:13,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903805242] [2022-07-14 13:52:13,620 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 13:52:13,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:13,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:13,621 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:13,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 13:52:13,790 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 31 check-sat command(s) [2022-07-14 13:52:13,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:13,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 779 conjuncts, 81 conjunts are in the unsatisfiable core [2022-07-14 13:52:13,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:14,210 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 820 proven. 1093 refuted. 0 times theorem prover too weak. 4052 trivial. 0 not checked. [2022-07-14 13:52:14,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:18,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5965 backedges. 1149 proven. 996 refuted. 0 times theorem prover too weak. 3820 trivial. 0 not checked. [2022-07-14 13:52:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903805242] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:18,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 29] total 40 [2022-07-14 13:52:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388186683] [2022-07-14 13:52:18,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:18,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-14 13:52:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-14 13:52:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=1273, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 13:52:18,755 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-14 13:52:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:18,856 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-07-14 13:52:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 13:52:18,856 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) Word has length 409 [2022-07-14 13:52:18,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:18,860 INFO L225 Difference]: With dead ends: 188 [2022-07-14 13:52:18,860 INFO L226 Difference]: Without dead ends: 187 [2022-07-14 13:52:18,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 978 GetRequests, 938 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=381, Invalid=1341, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 13:52:18,861 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 37 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:18,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 154 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:52:18,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-07-14 13:52:18,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2022-07-14 13:52:18,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 148 states have (on average 1.0135135135135136) internal successors, (150), 149 states have internal predecessors, (150), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (26), 24 states have call predecessors, (26), 24 states have call successors, (26) [2022-07-14 13:52:18,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 201 transitions. [2022-07-14 13:52:18,870 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 201 transitions. Word has length 409 [2022-07-14 13:52:18,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:18,871 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 201 transitions. [2022-07-14 13:52:18,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.55) internal successors, (102), 41 states have internal predecessors, (102), 11 states have call successors, (12), 1 states have call predecessors, (12), 11 states have return successors, (28), 28 states have call predecessors, (28), 11 states have call successors, (28) [2022-07-14 13:52:18,871 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 201 transitions. [2022-07-14 13:52:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2022-07-14 13:52:18,916 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 13:52:18,916 INFO L195 NwaCegarLoop]: trace histogram [109, 108, 88, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 34, 21, 1, 1, 1, 1] [2022-07-14 13:52:18,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 13:52:19,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 13:52:19,140 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-07-14 13:52:19,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 13:52:19,141 INFO L85 PathProgramCache]: Analyzing trace with hash -581544090, now seen corresponding path program 6 times [2022-07-14 13:52:19,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 13:52:19,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709064361] [2022-07-14 13:52:19,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 13:52:19,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 13:52:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:19,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 13:52:19,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:20,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 13:52:20,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-14 13:52:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 406 [2022-07-14 13:52:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:20,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 13:52:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 664 [2022-07-14 13:52:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:20,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:20,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:21,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:21,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-14 13:52:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-07-14 13:52:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 13:52:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 13:52:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-14 13:52:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-14 13:52:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 13:52:21,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 13:52:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2022-07-14 13:52:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 13:52:21,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709064361] [2022-07-14 13:52:21,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709064361] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 13:52:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1634267844] [2022-07-14 13:52:21,291 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 13:52:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 13:52:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 13:52:21,296 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 13:52:21,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 13:52:21,901 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 83 check-sat command(s) [2022-07-14 13:52:21,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 13:52:21,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 217 conjunts are in the unsatisfiable core [2022-07-14 13:52:21,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 13:52:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 6686 proven. 7802 refuted. 0 times theorem prover too weak. 26925 trivial. 0 not checked. [2022-07-14 13:52:22,927 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 13:52:47,260 INFO L134 CoverageAnalysis]: Checked inductivity of 41413 backedges. 7863 proven. 7339 refuted. 0 times theorem prover too weak. 26211 trivial. 0 not checked. [2022-07-14 13:52:47,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1634267844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 13:52:47,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 13:52:47,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 41] total 54 [2022-07-14 13:52:47,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443659793] [2022-07-14 13:52:47,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 13:52:47,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-14 13:52:47,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 13:52:47,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-14 13:52:47,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2022-07-14 13:52:47,265 INFO L87 Difference]: Start difference. First operand 187 states and 201 transitions. Second operand has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2022-07-14 13:52:47,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 13:52:47,363 INFO L93 Difference]: Finished difference Result 187 states and 201 transitions. [2022-07-14 13:52:47,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 13:52:47,364 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) Word has length 1064 [2022-07-14 13:52:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 13:52:47,366 INFO L225 Difference]: With dead ends: 187 [2022-07-14 13:52:47,366 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 13:52:47,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2559 GetRequests, 2506 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1468 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=642, Invalid=2328, Unknown=0, NotChecked=0, Total=2970 [2022-07-14 13:52:47,368 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 78 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 13:52:47,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 129 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 13:52:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 13:52:47,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 13:52:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 13:52:47,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 13:52:47,369 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1064 [2022-07-14 13:52:47,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 13:52:47,370 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 13:52:47,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.5185185185185186) internal successors, (136), 55 states have internal predecessors, (136), 15 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (38), 38 states have call predecessors, (38), 15 states have call successors, (38) [2022-07-14 13:52:47,370 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 13:52:47,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 13:52:47,372 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-07-14 13:52:47,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-07-14 13:52:47,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-07-14 13:52:47,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-07-14 13:52:47,373 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-07-14 13:52:47,374 INFO L805 garLoopResultBuilder]: Registering result SAFE for location fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-07-14 13:52:47,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-14 13:52:47,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 13:52:47,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 23) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciEXIT(lines 16 24) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point L17(lines 17 23) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciFINAL(lines 16 24) no Hoare annotation was computed. [2022-07-14 13:52:48,210 INFO L899 garLoopResultBuilder]: For program point fibonacciErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point fibonacciErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L902 garLoopResultBuilder]: At program point fibonacciENTRY(lines 16 24) the Hoare annotation is: true [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22-1(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L895 garLoopResultBuilder]: At program point L22-2(line 22) the Hoare annotation is: (and (or (not (<= |fibonacci_#in~n| 2)) (< 1 fibonacci_~n)) (or (not (<= |fibonacci_#in~n| 9)) (= fibonacci_~n |fibonacci_#in~n|))) [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22-3(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22-4(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22-5(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,211 INFO L895 garLoopResultBuilder]: At program point L22-6(line 22) the Hoare annotation is: (let ((.cse0 (<= 2 |fibonacci_#t~ret4|)) (.cse1 (= fibonacci_~n |fibonacci_#in~n|))) (and (or (not (<= 7 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 7)) (and .cse0 (<= |fibonacci_#t~ret4| 8) .cse1)) (or (not (<= |fibonacci_#in~n| 2)) (< 1 fibonacci_~n)) (or (not (<= |fibonacci_#in~n| 5)) (not (<= 5 |fibonacci_#in~n|)) (and .cse0 (<= |fibonacci_#t~ret4| 3) .cse1)) (or (and .cse0 (<= |fibonacci_#t~ret4| 21) .cse1) (not (<= |fibonacci_#in~n| 9)) (not (<= 9 |fibonacci_#in~n|))) (or (and .cse0 (<= |fibonacci_#t~ret4| 2) .cse1) (not (< 3 |fibonacci_#in~n|)) (not (<= |fibonacci_#in~n| 4))) (or (not (<= |fibonacci_#in~n| 8)) (and .cse0 (<= |fibonacci_#t~ret4| 13) .cse1) (not (<= 8 |fibonacci_#in~n|))) (or (not (<= |fibonacci_#in~n| 3)) (and (<= 1 |fibonacci_#t~ret4|) (<= |fibonacci_#t~ret4| 1) .cse1)) (or (and .cse0 (<= |fibonacci_#t~ret4| 5) .cse1) (not (<= |fibonacci_#in~n| 6)) (not (<= 6 |fibonacci_#in~n|))))) [2022-07-14 13:52:48,211 INFO L899 garLoopResultBuilder]: For program point L22-7(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point L22-8(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point L22-9(line 22) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 34) no Hoare annotation was computed. [2022-07-14 13:52:48,212 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-14 13:52:48,213 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (and (<= 9 |ULTIMATE.start_main_~x~0#1|) (<= |ULTIMATE.start_main_~x~0#1| 9)) [2022-07-14 13:52:48,213 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-14 13:52:48,213 INFO L899 garLoopResultBuilder]: For program point L29-1(line 29) no Hoare annotation was computed. [2022-07-14 13:52:48,214 INFO L895 garLoopResultBuilder]: At program point L27(lines 27 35) the Hoare annotation is: (<= |ULTIMATE.start_main_~x~0#1| 9) [2022-07-14 13:52:48,217 INFO L356 BasicCegarLoop]: Path program histogram: [6, 5, 2, 1, 1, 1, 1, 1] [2022-07-14 13:52:48,220 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 13:52:48,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 01:52:48 BoogieIcfgContainer [2022-07-14 13:52:48,234 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 13:52:48,234 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 13:52:48,234 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 13:52:48,235 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 13:52:48,235 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 01:52:00" (3/4) ... [2022-07-14 13:52:48,239 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 13:52:48,243 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fibonacci [2022-07-14 13:52:48,249 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-07-14 13:52:48,249 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-14 13:52:48,249 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-14 13:52:48,249 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 13:52:48,278 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 13:52:48,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 13:52:48,279 INFO L158 Benchmark]: Toolchain (without parser) took 48679.98ms. Allocated memory was 86.0MB in the beginning and 337.6MB in the end (delta: 251.7MB). Free memory was 53.1MB in the beginning and 199.5MB in the end (delta: -146.3MB). Peak memory consumption was 103.9MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,279 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:52:48,279 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.09ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.0MB in the beginning and 85.1MB in the end (delta: -32.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,279 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.37ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,280 INFO L158 Benchmark]: Boogie Preprocessor took 14.12ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 82.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 13:52:48,280 INFO L158 Benchmark]: RCFGBuilder took 273.32ms. Allocated memory is still 109.1MB. Free memory was 82.6MB in the beginning and 73.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,281 INFO L158 Benchmark]: TraceAbstraction took 48140.19ms. Allocated memory was 109.1MB in the beginning and 337.6MB in the end (delta: 228.6MB). Free memory was 73.2MB in the beginning and 202.6MB in the end (delta: -129.4MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,281 INFO L158 Benchmark]: Witness Printer took 43.73ms. Allocated memory is still 337.6MB. Free memory was 202.6MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 13:52:48,285 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 86.0MB. Free memory is still 44.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 179.09ms. Allocated memory was 86.0MB in the beginning and 109.1MB in the end (delta: 23.1MB). Free memory was 53.0MB in the beginning and 85.1MB in the end (delta: -32.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.37ms. Allocated memory is still 109.1MB. Free memory was 85.1MB in the beginning and 83.7MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.12ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 82.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 273.32ms. Allocated memory is still 109.1MB. Free memory was 82.6MB in the beginning and 73.7MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 48140.19ms. Allocated memory was 109.1MB in the beginning and 337.6MB in the end (delta: 228.6MB). Free memory was 73.2MB in the beginning and 202.6MB in the end (delta: -129.4MB). Peak memory consumption was 100.7MB. Max. memory is 16.1GB. * Witness Printer took 43.73ms. Allocated memory is still 337.6MB. Free memory was 202.6MB in the beginning and 199.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 30 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 48.1s, OverallIterations: 18, TraceHistogramMax: 109, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2098 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2042 mSDsluCounter, 2764 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2270 mSDsCounter, 721 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3991 IncrementalHoareTripleChecker+Invalid, 4712 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 721 mSolverCounterUnsat, 494 mSDtfsCounter, 3991 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5642 GetRequests, 5233 SyntacticMatches, 6 SemanticMatches, 403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4201 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=325occurred in iteration=9, InterpolantAutomatonStates: 265, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 190 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 551 PreInvPairs, 644 NumberOfFragments, 166 HoareAnnotationTreeSize, 551 FomulaSimplifications, 3131 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 1628 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 38.0s InterpolantComputationTime, 4946 NumberOfCodeBlocks, 4797 NumberOfCodeBlocksAsserted, 161 NumberOfCheckSat, 7161 ConstructedInterpolants, 0 QuantifiedInterpolants, 16907 SizeOfPredicates, 41 NumberOfNonLiveVariables, 4422 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 42 InterpolantComputations, 7 PerfectInterpolantSequences, 123900/152393 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: x <= 9 RESULT: Ultimate proved your program to be correct! [2022-07-14 13:52:48,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE