/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-4f750a8 [2020-12-22 07:03:02,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-22 07:03:02,951 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-22 07:03:03,004 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-22 07:03:03,005 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-22 07:03:03,008 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-22 07:03:03,012 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-22 07:03:03,020 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-22 07:03:03,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-22 07:03:03,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-22 07:03:03,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-22 07:03:03,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-22 07:03:03,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-22 07:03:03,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-22 07:03:03,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-22 07:03:03,042 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-22 07:03:03,044 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-22 07:03:03,048 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-22 07:03:03,056 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-22 07:03:03,061 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-22 07:03:03,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-22 07:03:03,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-22 07:03:03,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-22 07:03:03,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-22 07:03:03,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-22 07:03:03,078 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-22 07:03:03,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-22 07:03:03,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-22 07:03:03,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-22 07:03:03,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-22 07:03:03,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-22 07:03:03,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-22 07:03:03,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-22 07:03:03,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-22 07:03:03,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-22 07:03:03,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-22 07:03:03,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-22 07:03:03,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-22 07:03:03,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-22 07:03:03,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-22 07:03:03,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-22 07:03:03,095 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-22 07:03:03,121 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-22 07:03:03,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-22 07:03:03,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-22 07:03:03,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-22 07:03:03,123 INFO L138 SettingsManager]: * Use SBE=true [2020-12-22 07:03:03,124 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-22 07:03:03,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-22 07:03:03,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-22 07:03:03,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-22 07:03:03,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-22 07:03:03,125 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-22 07:03:03,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-22 07:03:03,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-22 07:03:03,125 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-22 07:03:03,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-22 07:03:03,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-22 07:03:03,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-22 07:03:03,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:03:03,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-22 07:03:03,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-22 07:03:03,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-22 07:03:03,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-22 07:03:03,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-22 07:03:03,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-22 07:03:03,151 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-22 07:03:03,151 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 [2020-12-22 07:03:03,520 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-22 07:03:03,555 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-22 07:03:03,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-22 07:03:03,560 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-22 07:03:03,561 INFO L275 PluginConnector]: CDTParser initialized [2020-12-22 07:03:03,562 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-12-22 07:03:03,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78378255f/aeed32bd5ca949a1b1917460135b07b1/FLAGe1f268df0 [2020-12-22 07:03:04,307 INFO L306 CDTParser]: Found 1 translation units. [2020-12-22 07:03:04,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-12-22 07:03:04,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78378255f/aeed32bd5ca949a1b1917460135b07b1/FLAGe1f268df0 [2020-12-22 07:03:04,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78378255f/aeed32bd5ca949a1b1917460135b07b1 [2020-12-22 07:03:04,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-22 07:03:04,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-22 07:03:04,362 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-22 07:03:04,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-22 07:03:04,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-22 07:03:04,367 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,370 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b638b4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04, skipping insertion in model container [2020-12-22 07:03:04,371 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-22 07:03:04,398 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-22 07:03:04,643 WARN L226 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-simple/fibo_7-2.c[741,754] [2020-12-22 07:03:04,651 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:03:04,667 INFO L203 MainTranslator]: Completed pre-run [2020-12-22 07:03:04,691 WARN L226 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-simple/fibo_7-2.c[741,754] [2020-12-22 07:03:04,693 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-22 07:03:04,714 INFO L208 MainTranslator]: Completed translation [2020-12-22 07:03:04,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04 WrapperNode [2020-12-22 07:03:04,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-22 07:03:04,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-22 07:03:04,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-22 07:03:04,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-22 07:03:04,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,744 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,767 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-22 07:03:04,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-22 07:03:04,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-22 07:03:04,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-22 07:03:04,782 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,792 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,795 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... [2020-12-22 07:03:04,806 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-22 07:03:04,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-22 07:03:04,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-22 07:03:04,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-22 07:03:04,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-22 07:03:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-22 07:03:04,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-22 07:03:04,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-22 07:03:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-22 07:03:04,938 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-12-22 07:03:04,939 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-12-22 07:03:05,187 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-22 07:03:05,188 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-22 07:03:05,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:03:05 BoogieIcfgContainer [2020-12-22 07:03:05,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-22 07:03:05,192 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-22 07:03:05,192 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-22 07:03:05,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-22 07:03:05,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 07:03:04" (1/3) ... [2020-12-22 07:03:05,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129ad8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:03:05, skipping insertion in model container [2020-12-22 07:03:05,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 07:03:04" (2/3) ... [2020-12-22 07:03:05,198 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@129ad8f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 07:03:05, skipping insertion in model container [2020-12-22 07:03:05,198 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:03:05" (3/3) ... [2020-12-22 07:03:05,200 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-12-22 07:03:05,207 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-22 07:03:05,213 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-22 07:03:05,244 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-22 07:03:05,285 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-22 07:03:05,286 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-22 07:03:05,286 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-22 07:03:05,286 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-22 07:03:05,286 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-22 07:03:05,287 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-22 07:03:05,287 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-22 07:03:05,287 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-22 07:03:05,307 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-12-22 07:03:05,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-22 07:03:05,317 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:05,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:05,319 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:05,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:05,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2020-12-22 07:03:05,378 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:05,379 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319213459] [2020-12-22 07:03:05,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:05,657 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:03:05,704 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319213459] [2020-12-22 07:03:05,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:03:05,706 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:03:05,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920383279] [2020-12-22 07:03:05,716 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:03:05,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:05,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:03:05,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:03:05,741 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-12-22 07:03:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:05,796 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-12-22 07:03:05,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:03:05,799 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-22 07:03:05,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:05,810 INFO L225 Difference]: With dead ends: 34 [2020-12-22 07:03:05,811 INFO L226 Difference]: Without dead ends: 18 [2020-12-22 07:03:05,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:03:05,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-22 07:03:05,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-12-22 07:03:05,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 07:03:05,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 07:03:05,863 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-12-22 07:03:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:05,864 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 07:03:05,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:03:05,864 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 07:03:05,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-22 07:03:05,866 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:05,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:05,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-22 07:03:05,867 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:05,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:05,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2020-12-22 07:03:05,869 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:05,869 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663745732] [2020-12-22 07:03:05,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:05,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:05,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:05,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-22 07:03:05,948 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663745732] [2020-12-22 07:03:05,948 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-22 07:03:05,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-22 07:03:05,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748954026] [2020-12-22 07:03:05,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-22 07:03:05,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-22 07:03:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:03:05,952 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-12-22 07:03:05,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:05,973 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-12-22 07:03:05,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-22 07:03:05,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-22 07:03:05,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:05,976 INFO L225 Difference]: With dead ends: 24 [2020-12-22 07:03:05,976 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 07:03:05,977 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-22 07:03:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 07:03:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-12-22 07:03:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-22 07:03:05,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-22 07:03:05,985 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-12-22 07:03:05,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:05,985 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-22 07:03:05,985 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-22 07:03:05,985 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-22 07:03:05,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-22 07:03:05,987 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:05,987 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:05,987 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-22 07:03:05,987 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2020-12-22 07:03:05,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:05,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238616371] [2020-12-22 07:03:05,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:06,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-22 07:03:06,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:03:06,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238616371] [2020-12-22 07:03:06,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530887135] [2020-12-22 07:03:06,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 07:03:06,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:03:06,348 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-22 07:03:06,349 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:03:06,349 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-22 07:03:06,349 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158673737] [2020-12-22 07:03:06,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-22 07:03:06,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:06,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-22 07:03:06,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:03:06,352 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-12-22 07:03:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:06,493 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-12-22 07:03:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-22 07:03:06,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-22 07:03:06,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:06,495 INFO L225 Difference]: With dead ends: 35 [2020-12-22 07:03:06,495 INFO L226 Difference]: Without dead ends: 20 [2020-12-22 07:03:06,497 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:03:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-22 07:03:06,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-22 07:03:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-22 07:03:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-12-22 07:03:06,529 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-12-22 07:03:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:06,530 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-12-22 07:03:06,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-22 07:03:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-12-22 07:03:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-22 07:03:06,532 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:06,532 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:06,746 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-22 07:03:06,747 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:06,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2020-12-22 07:03:06,749 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:06,750 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974384062] [2020-12-22 07:03:06,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:06,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:06,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:03:06,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974384062] [2020-12-22 07:03:06,864 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111393029] [2020-12-22 07:03:06,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:06,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:06,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-22 07:03:06,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:03:07,015 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-22 07:03:07,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:03:07,019 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-22 07:03:07,019 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138624992] [2020-12-22 07:03:07,020 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-22 07:03:07,020 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:07,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-22 07:03:07,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-22 07:03:07,022 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2020-12-22 07:03:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:07,128 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-12-22 07:03:07,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-22 07:03:07,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-22 07:03:07,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:07,132 INFO L225 Difference]: With dead ends: 38 [2020-12-22 07:03:07,132 INFO L226 Difference]: Without dead ends: 34 [2020-12-22 07:03:07,133 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-22 07:03:07,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-22 07:03:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-22 07:03:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-22 07:03:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-12-22 07:03:07,145 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-12-22 07:03:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:07,146 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-12-22 07:03:07,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-22 07:03:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-12-22 07:03:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-22 07:03:07,148 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:07,148 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:07,362 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:07,363 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:07,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2020-12-22 07:03:07,365 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:07,365 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133881869] [2020-12-22 07:03:07,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:07,544 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-22 07:03:07,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133881869] [2020-12-22 07:03:07,544 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77833755] [2020-12-22 07:03:07,545 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:07,616 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-22 07:03:07,617 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 07:03:07,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 07:03:07,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:03:07,787 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-22 07:03:07,788 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:03:07,788 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-22 07:03:07,789 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415234897] [2020-12-22 07:03:07,789 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 07:03:07,790 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:07,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 07:03:07,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:03:07,791 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 13 states. [2020-12-22 07:03:08,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:08,073 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-12-22 07:03:08,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-22 07:03:08,074 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-12-22 07:03:08,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:08,076 INFO L225 Difference]: With dead ends: 69 [2020-12-22 07:03:08,077 INFO L226 Difference]: Without dead ends: 38 [2020-12-22 07:03:08,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-12-22 07:03:08,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-22 07:03:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-22 07:03:08,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-22 07:03:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-12-22 07:03:08,088 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-12-22 07:03:08,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:08,089 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-12-22 07:03:08,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 07:03:08,089 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-12-22 07:03:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-22 07:03:08,092 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:08,092 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:08,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:08,306 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:08,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:08,308 INFO L82 PathProgramCache]: Analyzing trace with hash 366248375, now seen corresponding path program 3 times [2020-12-22 07:03:08,309 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:08,309 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761769509] [2020-12-22 07:03:08,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,586 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,603 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:08,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 07:03:08,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,629 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,639 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:08,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:08,660 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-22 07:03:08,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761769509] [2020-12-22 07:03:08,661 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085138649] [2020-12-22 07:03:08,661 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:08,723 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-22 07:03:08,723 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 07:03:08,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-22 07:03:08,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:03:08,862 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-12-22 07:03:08,863 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:03:08,863 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2020-12-22 07:03:08,878 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109135068] [2020-12-22 07:03:08,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-22 07:03:08,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:08,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-22 07:03:08,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-22 07:03:08,881 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 13 states. [2020-12-22 07:03:09,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:09,101 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-12-22 07:03:09,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-22 07:03:09,102 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2020-12-22 07:03:09,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:09,107 INFO L225 Difference]: With dead ends: 94 [2020-12-22 07:03:09,107 INFO L226 Difference]: Without dead ends: 90 [2020-12-22 07:03:09,109 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-22 07:03:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-22 07:03:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-12-22 07:03:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-22 07:03:09,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-12-22 07:03:09,130 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-12-22 07:03:09,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:09,130 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-12-22 07:03:09,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-22 07:03:09,131 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-12-22 07:03:09,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-22 07:03:09,136 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:09,137 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:09,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:09,351 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:09,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 4 times [2020-12-22 07:03:09,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:09,353 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425500170] [2020-12-22 07:03:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:09,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-22 07:03:09,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:09,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 07:03:09,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:09,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 07:03:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:09,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-22 07:03:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:09,999 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,003 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-22 07:03:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:10,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,074 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-22 07:03:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-22 07:03:10,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-22 07:03:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-22 07:03:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-22 07:03:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2020-12-22 07:03:10,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425500170] [2020-12-22 07:03:10,259 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937932835] [2020-12-22 07:03:10,259 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-22 07:03:10,363 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-22 07:03:10,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-22 07:03:10,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-22 07:03:10,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-22 07:03:10,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-12-22 07:03:10,739 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-22 07:03:10,740 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 22 [2020-12-22 07:03:10,740 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94606968] [2020-12-22 07:03:10,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-22 07:03:10,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-22 07:03:10,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-22 07:03:10,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2020-12-22 07:03:10,743 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 22 states. [2020-12-22 07:03:11,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-22 07:03:11,353 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2020-12-22 07:03:11,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-22 07:03:11,354 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2020-12-22 07:03:11,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-22 07:03:11,357 INFO L225 Difference]: With dead ends: 170 [2020-12-22 07:03:11,357 INFO L226 Difference]: Without dead ends: 87 [2020-12-22 07:03:11,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2020-12-22 07:03:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-22 07:03:11,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-12-22 07:03:11,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-22 07:03:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2020-12-22 07:03:11,377 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 215 [2020-12-22 07:03:11,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-22 07:03:11,377 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2020-12-22 07:03:11,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-22 07:03:11,378 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2020-12-22 07:03:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-22 07:03:11,383 INFO L414 BasicCegarLoop]: Found error trace [2020-12-22 07:03:11,384 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-12-22 07:03:11,600 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-22 07:03:11,601 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-22 07:03:11,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-22 07:03:11,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 5 times [2020-12-22 07:03:11,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-22 07:03:11,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842866071] [2020-12-22 07:03:11,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-22 07:03:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:03:11,660 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:03:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-22 07:03:11,717 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-22 07:03:11,801 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-22 07:03:11,802 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-22 07:03:11,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-22 07:03:11,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 07:03:11 BoogieIcfgContainer [2020-12-22 07:03:11,924 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-22 07:03:11,925 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-22 07:03:11,925 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-22 07:03:11,925 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-22 07:03:11,926 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 07:03:05" (3/4) ... [2020-12-22 07:03:11,928 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-22 07:03:12,064 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive-simple/fibo_7-2.c-witness.graphml [2020-12-22 07:03:12,064 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-22 07:03:12,070 INFO L168 Benchmark]: Toolchain (without parser) took 7707.05 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 126.8 MB in the beginning and 124.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 84.3 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,070 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 151.0 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-22 07:03:12,071 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.36 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 117.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,071 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,072 INFO L168 Benchmark]: Boogie Preprocessor took 35.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 115.1 MB in the end (delta: 892.4 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,072 INFO L168 Benchmark]: RCFGBuilder took 381.85 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 103.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,072 INFO L168 Benchmark]: TraceAbstraction took 6732.70 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 103.2 MB in the beginning and 137.4 MB in the end (delta: -34.3 MB). Peak memory consumption was 47.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,073 INFO L168 Benchmark]: Witness Printer took 138.99 ms. Allocated memory is still 231.7 MB. Free memory was 137.4 MB in the beginning and 124.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-22 07:03:12,076 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.19 ms. Allocated memory is still 151.0 MB. Free memory is still 127.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 354.36 ms. Allocated memory is still 151.0 MB. Free memory was 126.6 MB in the beginning and 117.4 MB in the end (delta: 9.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 52.01 ms. Allocated memory is still 151.0 MB. Free memory was 117.4 MB in the beginning and 116.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 35.59 ms. Allocated memory is still 151.0 MB. Free memory was 116.0 MB in the beginning and 115.1 MB in the end (delta: 892.4 kB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 381.85 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 103.6 MB in the end (delta: 11.5 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 6732.70 ms. Allocated memory was 151.0 MB in the beginning and 231.7 MB in the end (delta: 80.7 MB). Free memory was 103.2 MB in the beginning and 137.4 MB in the end (delta: -34.3 MB). Peak memory consumption was 47.6 MB. Max. memory is 8.0 GB. * Witness Printer took 138.99 ms. Allocated memory is still 231.7 MB. Free memory was 137.4 MB in the beginning and 124.8 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 41, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 128 SDtfs, 328 SDslu, 391 SDs, 0 SdLazy, 635 SolverSat, 359 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 577 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1060 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 765 ConstructedInterpolants, 0 QuantifiedInterpolants, 181895 SizeOfPredicates, 21 NumberOfNonLiveVariables, 803 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 4266/5896 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...