/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:01:41,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:01:41,796 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:01:41,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:01:41,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:01:41,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:01:41,842 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:01:41,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:01:41,847 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:01:41,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:01:41,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:01:41,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:01:41,852 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:01:41,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:01:41,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:01:41,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:01:41,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:01:41,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:01:41,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:01:41,863 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:01:41,865 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:01:41,866 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:01:41,868 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:01:41,869 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:01:41,892 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:01:41,893 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:01:41,893 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:01:41,894 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:01:41,895 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:01:41,896 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:01:41,897 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:01:41,898 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:01:41,899 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:01:41,900 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:01:41,901 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:01:41,902 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:01:41,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:01:41,903 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:01:41,903 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:01:41,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:01:41,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:01:41,907 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-06 22:01:41,936 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:01:41,936 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:01:41,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:01:41,938 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:01:41,938 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:01:41,939 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:01:41,939 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:01:41,939 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:01:41,940 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:01:41,940 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:01:41,940 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:01:41,940 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:01:41,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:01:41,941 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:01:41,941 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:01:41,941 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:01:41,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:01:41,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:01:41,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:01:41,943 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:01:41,943 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:01:41,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:01:41,944 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:01:41,944 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:01:41,944 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:01:41,944 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:01:41,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:01:41,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:01:41,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:01:41,946 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-11-06 22:01:42,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:01:42,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:01:42,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:01:42,368 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:01:42,369 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:01:42,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-06 22:01:42,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367594fb8/34ebcf10bde94af8863cd5c3850ca550/FLAG892a00f07 [2020-11-06 22:01:43,110 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:01:43,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2020-11-06 22:01:43,119 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367594fb8/34ebcf10bde94af8863cd5c3850ca550/FLAG892a00f07 [2020-11-06 22:01:43,483 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/367594fb8/34ebcf10bde94af8863cd5c3850ca550 [2020-11-06 22:01:43,486 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:01:43,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:01:43,496 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:01:43,496 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:01:43,500 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:01:43,501 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,505 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43, skipping insertion in model container [2020-11-06 22:01:43,505 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,518 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:01:43,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:01:43,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:01:43,713 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:01:43,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:01:43,752 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:01:43,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43 WrapperNode [2020-11-06 22:01:43,752 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:01:43,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:01:43,754 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:01:43,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:01:43,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,767 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,775 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (1/1) ... [2020-11-06 22:01:43,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:01:43,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:01:43,792 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:01:43,792 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:01:43,793 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (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-11-06 22:01:43,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:01:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:01:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:01:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2020-11-06 22:01:43,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:01:43,874 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:01:43,874 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:01:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:01:43,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:01:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-06 22:01:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2020-11-06 22:01:43,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:01:43,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:01:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:01:43,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:01:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:01:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:01:43,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:01:44,155 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:01:44,155 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-06 22:01:44,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:44 BoogieIcfgContainer [2020-11-06 22:01:44,157 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:01:44,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:01:44,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:01:44,163 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:01:44,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:01:43" (1/3) ... [2020-11-06 22:01:44,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:44, skipping insertion in model container [2020-11-06 22:01:44,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:01:43" (2/3) ... [2020-11-06 22:01:44,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@459c499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:01:44, skipping insertion in model container [2020-11-06 22:01:44,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:01:44" (3/3) ... [2020-11-06 22:01:44,167 INFO L111 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2020-11-06 22:01:44,229 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:01:44,242 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:01:44,300 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:01:44,346 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:01:44,347 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:01:44,347 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:01:44,347 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:01:44,347 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:01:44,348 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:01:44,348 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:01:44,348 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:01:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2020-11-06 22:01:44,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-06 22:01:44,379 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:44,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:44,380 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:44,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:44,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2107265492, now seen corresponding path program 1 times [2020-11-06 22:01:44,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:44,399 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809606748] [2020-11-06 22:01:44,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:44,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:44,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:44,823 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:44,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:01:44,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809606748] [2020-11-06 22:01:44,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:01:44,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:01:44,868 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724688743] [2020-11-06 22:01:44,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:01:44,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:44,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:01:44,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:01:44,894 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 6 states. [2020-11-06 22:01:45,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:45,191 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-11-06 22:01:45,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:01:45,193 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-11-06 22:01:45,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:45,204 INFO L225 Difference]: With dead ends: 41 [2020-11-06 22:01:45,204 INFO L226 Difference]: Without dead ends: 23 [2020-11-06 22:01:45,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:01:45,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-11-06 22:01:45,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-11-06 22:01:45,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-06 22:01:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-06 22:01:45,261 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-11-06 22:01:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:45,261 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-06 22:01:45,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:01:45,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-11-06 22:01:45,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-06 22:01:45,264 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:45,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:45,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:01:45,265 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:45,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:45,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1001048603, now seen corresponding path program 1 times [2020-11-06 22:01:45,266 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:45,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818500306] [2020-11-06 22:01:45,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:45,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:01:45,387 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818500306] [2020-11-06 22:01:45,388 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:01:45,388 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-06 22:01:45,388 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668867147] [2020-11-06 22:01:45,390 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-06 22:01:45,390 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:45,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-06 22:01:45,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:01:45,392 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-11-06 22:01:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:45,660 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-11-06 22:01:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:01:45,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-11-06 22:01:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:45,663 INFO L225 Difference]: With dead ends: 30 [2020-11-06 22:01:45,663 INFO L226 Difference]: Without dead ends: 25 [2020-11-06 22:01:45,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:01:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-06 22:01:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-11-06 22:01:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-11-06 22:01:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-11-06 22:01:45,674 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2020-11-06 22:01:45,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:45,675 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-11-06 22:01:45,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-06 22:01:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-11-06 22:01:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-11-06 22:01:45,676 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:45,677 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:45,677 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:01:45,677 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash -768223736, now seen corresponding path program 1 times [2020-11-06 22:01:45,678 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:45,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398330580] [2020-11-06 22:01:45,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-11-06 22:01:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:01:45,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398330580] [2020-11-06 22:01:45,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232891341] [2020-11-06 22:01:45,815 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-11-06 22:01:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:45,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:01:45,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:46,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:01:46,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:46,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-11-06 22:01:46,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044416304] [2020-11-06 22:01:46,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-06 22:01:46,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-06 22:01:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-11-06 22:01:46,027 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-11-06 22:01:46,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:46,327 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-11-06 22:01:46,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:01:46,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-11-06 22:01:46,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:46,329 INFO L225 Difference]: With dead ends: 41 [2020-11-06 22:01:46,329 INFO L226 Difference]: Without dead ends: 25 [2020-11-06 22:01:46,330 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:01:46,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-11-06 22:01:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-11-06 22:01:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-11-06 22:01:46,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-11-06 22:01:46,339 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 28 [2020-11-06 22:01:46,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:46,340 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-11-06 22:01:46,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-06 22:01:46,340 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-11-06 22:01:46,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-06 22:01:46,342 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:46,342 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:46,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:01:46,557 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:46,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1973821333, now seen corresponding path program 1 times [2020-11-06 22:01:46,559 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:46,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239874875] [2020-11-06 22:01:46,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:46,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:01:46,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239874875] [2020-11-06 22:01:46,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132045648] [2020-11-06 22:01:46,720 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-11-06 22:01:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:46,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:01:46,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-06 22:01:46,822 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:46,822 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-11-06 22:01:46,823 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969229462] [2020-11-06 22:01:46,823 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:01:46,824 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:01:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:01:46,825 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-11-06 22:01:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:47,215 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-11-06 22:01:47,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-06 22:01:47,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-11-06 22:01:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:47,221 INFO L225 Difference]: With dead ends: 44 [2020-11-06 22:01:47,222 INFO L226 Difference]: Without dead ends: 39 [2020-11-06 22:01:47,223 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:01:47,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-11-06 22:01:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-11-06 22:01:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-11-06 22:01:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-11-06 22:01:47,247 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 29 [2020-11-06 22:01:47,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:47,250 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-11-06 22:01:47,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:01:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-11-06 22:01:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-11-06 22:01:47,255 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:47,255 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:47,469 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:47,470 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:47,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:47,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1902544615, now seen corresponding path program 2 times [2020-11-06 22:01:47,472 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:47,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839839895] [2020-11-06 22:01:47,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:47,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:47,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:47,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:47,720 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-11-06 22:01:47,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839839895] [2020-11-06 22:01:47,720 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533604416] [2020-11-06 22:01:47,721 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-11-06 22:01:47,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:01:47,793 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:01:47,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:01:47,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:47,922 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-11-06 22:01:47,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:47,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-11-06 22:01:47,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950315204] [2020-11-06 22:01:47,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:01:47,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:01:47,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:01:47,925 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 13 states. [2020-11-06 22:01:48,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:48,935 INFO L93 Difference]: Finished difference Result 74 states and 109 transitions. [2020-11-06 22:01:48,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-06 22:01:48,941 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-11-06 22:01:48,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:48,942 INFO L225 Difference]: With dead ends: 74 [2020-11-06 22:01:48,943 INFO L226 Difference]: Without dead ends: 40 [2020-11-06 22:01:48,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=457, Unknown=0, NotChecked=0, Total=600 [2020-11-06 22:01:48,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-11-06 22:01:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2020-11-06 22:01:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-06 22:01:48,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2020-11-06 22:01:48,954 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 42 [2020-11-06 22:01:48,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:48,955 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2020-11-06 22:01:48,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:01:48,955 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2020-11-06 22:01:48,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-06 22:01:48,957 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:48,957 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:49,170 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:49,171 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:49,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:49,173 INFO L82 PathProgramCache]: Analyzing trace with hash -217233873, now seen corresponding path program 3 times [2020-11-06 22:01:49,173 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:49,174 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687961164] [2020-11-06 22:01:49,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:49,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:49,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,483 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:49,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:49,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,534 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:49,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:49,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:49,565 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-11-06 22:01:49,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687961164] [2020-11-06 22:01:49,566 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [520885952] [2020-11-06 22:01:49,566 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-11-06 22:01:49,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-11-06 22:01:49,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:01:49,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 8 conjunts are in the unsatisfiable core [2020-11-06 22:01:49,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-11-06 22:01:49,735 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:49,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2020-11-06 22:01:49,736 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029618630] [2020-11-06 22:01:49,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:01:49,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:49,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:01:49,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:01:49,740 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 11 states. [2020-11-06 22:01:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:50,483 INFO L93 Difference]: Finished difference Result 90 states and 129 transitions. [2020-11-06 22:01:50,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-06 22:01:50,484 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2020-11-06 22:01:50,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:50,487 INFO L225 Difference]: With dead ends: 90 [2020-11-06 22:01:50,487 INFO L226 Difference]: Without dead ends: 52 [2020-11-06 22:01:50,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-11-06 22:01:50,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-06 22:01:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-11-06 22:01:50,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-11-06 22:01:50,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2020-11-06 22:01:50,504 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 70 [2020-11-06 22:01:50,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:50,505 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-11-06 22:01:50,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:01:50,505 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2020-11-06 22:01:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-06 22:01:50,511 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:50,511 INFO L422 BasicCegarLoop]: trace histogram [21, 21, 17, 10, 10, 10, 10, 10, 10, 10, 7, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:50,724 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:50,725 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:50,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:50,726 INFO L82 PathProgramCache]: Analyzing trace with hash 704043195, now seen corresponding path program 4 times [2020-11-06 22:01:50,726 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:50,726 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535019123] [2020-11-06 22:01:50,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:50,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:50,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:50,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:50,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:50,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:50,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:51,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,045 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,061 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,080 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:51,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:51,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 57 proven. 377 refuted. 0 times theorem prover too weak. 722 trivial. 0 not checked. [2020-11-06 22:01:51,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535019123] [2020-11-06 22:01:51,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126270092] [2020-11-06 22:01:51,222 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-11-06 22:01:51,298 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-06 22:01:51,298 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:01:51,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 18 conjunts are in the unsatisfiable core [2020-11-06 22:01:51,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:51,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 249 proven. 418 refuted. 0 times theorem prover too weak. 489 trivial. 0 not checked. [2020-11-06 22:01:51,580 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:51,580 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 17 [2020-11-06 22:01:51,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032669080] [2020-11-06 22:01:51,582 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-11-06 22:01:51,582 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:51,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-11-06 22:01:51,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:01:51,588 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 17 states. [2020-11-06 22:01:53,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:53,139 INFO L93 Difference]: Finished difference Result 114 states and 175 transitions. [2020-11-06 22:01:53,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-06 22:01:53,140 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 152 [2020-11-06 22:01:53,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:53,142 INFO L225 Difference]: With dead ends: 114 [2020-11-06 22:01:53,142 INFO L226 Difference]: Without dead ends: 70 [2020-11-06 22:01:53,145 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=307, Invalid=1025, Unknown=0, NotChecked=0, Total=1332 [2020-11-06 22:01:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-11-06 22:01:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2020-11-06 22:01:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-06 22:01:53,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2020-11-06 22:01:53,161 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 152 [2020-11-06 22:01:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:53,162 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2020-11-06 22:01:53,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-11-06 22:01:53,162 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2020-11-06 22:01:53,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2020-11-06 22:01:53,166 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:53,167 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:53,382 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:01:53,383 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:53,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:53,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1914022046, now seen corresponding path program 5 times [2020-11-06 22:01:53,384 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:53,384 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331706956] [2020-11-06 22:01:53,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,518 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:53,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,709 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:53,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:53,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:53,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:01:53,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,961 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:53,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:53,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:53,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:53,997 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:54,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:54,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:54,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:54,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:54,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-11-06 22:01:54,158 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331706956] [2020-11-06 22:01:54,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203055749] [2020-11-06 22:01:54,159 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:54,282 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-11-06 22:01:54,282 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:01:54,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2020-11-06 22:01:54,299 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2020-11-06 22:01:54,515 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:54,516 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 20 [2020-11-06 22:01:54,516 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227308140] [2020-11-06 22:01:54,517 INFO L461 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-11-06 22:01:54,517 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-11-06 22:01:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2020-11-06 22:01:54,518 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 20 states. [2020-11-06 22:01:56,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:56,870 INFO L93 Difference]: Finished difference Result 149 states and 224 transitions. [2020-11-06 22:01:56,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-11-06 22:01:56,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 220 [2020-11-06 22:01:56,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:56,875 INFO L225 Difference]: With dead ends: 149 [2020-11-06 22:01:56,875 INFO L226 Difference]: Without dead ends: 90 [2020-11-06 22:01:56,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 279 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=440, Invalid=1630, Unknown=0, NotChecked=0, Total=2070 [2020-11-06 22:01:56,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-11-06 22:01:56,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2020-11-06 22:01:56,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-11-06 22:01:56,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 108 transitions. [2020-11-06 22:01:56,915 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 108 transitions. Word has length 220 [2020-11-06 22:01:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:56,918 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 108 transitions. [2020-11-06 22:01:56,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-11-06 22:01:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 108 transitions. [2020-11-06 22:01:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-11-06 22:01:56,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:56,931 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:57,146 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:57,147 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:57,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:57,149 INFO L82 PathProgramCache]: Analyzing trace with hash 816815899, now seen corresponding path program 6 times [2020-11-06 22:01:57,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:57,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063654120] [2020-11-06 22:01:57,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:01:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:01:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,423 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,650 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,669 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,674 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:57,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-11-06 22:01:57,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-11-06 22:01:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-06 22:01:57,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-11-06 22:01:57,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-11-06 22:01:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,861 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-11-06 22:01:57,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:57,863 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-11-06 22:01:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:01:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-11-06 22:01:58,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063654120] [2020-11-06 22:01:58,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777128378] [2020-11-06 22:01:58,013 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:58,153 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-11-06 22:01:58,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:01:58,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 14 conjunts are in the unsatisfiable core [2020-11-06 22:01:58,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:01:58,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2020-11-06 22:01:58,282 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:01:58,282 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2020-11-06 22:01:58,282 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512294828] [2020-11-06 22:01:58,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-06 22:01:58,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:01:58,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-06 22:01:58,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-11-06 22:01:58,286 INFO L87 Difference]: Start difference. First operand 83 states and 108 transitions. Second operand 13 states. [2020-11-06 22:01:59,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:01:59,374 INFO L93 Difference]: Finished difference Result 266 states and 392 transitions. [2020-11-06 22:01:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-11-06 22:01:59,375 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 288 [2020-11-06 22:01:59,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:01:59,389 INFO L225 Difference]: With dead ends: 266 [2020-11-06 22:01:59,389 INFO L226 Difference]: Without dead ends: 261 [2020-11-06 22:01:59,390 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2020-11-06 22:01:59,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2020-11-06 22:01:59,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 246. [2020-11-06 22:01:59,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2020-11-06 22:01:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2020-11-06 22:01:59,487 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 288 [2020-11-06 22:01:59,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:01:59,488 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2020-11-06 22:01:59,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-06 22:01:59,488 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2020-11-06 22:01:59,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2020-11-06 22:01:59,499 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:01:59,500 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:01:59,713 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:01:59,713 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:01:59,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:01:59,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2114856643, now seen corresponding path program 7 times [2020-11-06 22:01:59,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:01:59,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615686685] [2020-11-06 22:01:59,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:01:59,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:01:59,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:01:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-06 22:01:59,958 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-06 22:02:00,154 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-06 22:02:00,155 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-06 22:02:00,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-06 22:02:00,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:02:00 BoogieIcfgContainer [2020-11-06 22:02:00,313 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:02:00,315 INFO L168 Benchmark]: Toolchain (without parser) took 16825.66 ms. Allocated memory was 156.2 MB in the beginning and 348.1 MB in the end (delta: 191.9 MB). Free memory was 131.6 MB in the beginning and 174.9 MB in the end (delta: -43.2 MB). Peak memory consumption was 149.8 MB. Max. memory is 8.0 GB. [2020-11-06 22:02:00,316 INFO L168 Benchmark]: CDTParser took 1.12 ms. Allocated memory is still 156.2 MB. Free memory is still 130.0 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:02:00,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.95 ms. Allocated memory is still 156.2 MB. Free memory was 131.0 MB in the beginning and 122.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. [2020-11-06 22:02:00,317 INFO L168 Benchmark]: Boogie Preprocessor took 37.00 ms. Allocated memory is still 156.2 MB. Free memory was 122.1 MB in the beginning and 120.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:02:00,318 INFO L168 Benchmark]: RCFGBuilder took 365.86 ms. Allocated memory is still 156.2 MB. Free memory was 120.7 MB in the beginning and 107.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:02:00,318 INFO L168 Benchmark]: TraceAbstraction took 16154.04 ms. Allocated memory was 156.2 MB in the beginning and 348.1 MB in the end (delta: 191.9 MB). Free memory was 107.1 MB in the beginning and 174.9 MB in the end (delta: -67.8 MB). Peak memory consumption was 124.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:02:00,321 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.12 ms. Allocated memory is still 156.2 MB. Free memory is still 130.0 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 256.95 ms. Allocated memory is still 156.2 MB. Free memory was 131.0 MB in the beginning and 122.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 8.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 37.00 ms. Allocated memory is still 156.2 MB. Free memory was 122.1 MB in the beginning and 120.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 365.86 ms. Allocated memory is still 156.2 MB. Free memory was 120.7 MB in the beginning and 107.5 MB in the end (delta: 13.2 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 16154.04 ms. Allocated memory was 156.2 MB in the beginning and 348.1 MB in the end (delta: 191.9 MB). Free memory was 107.1 MB in the beginning and 174.9 MB in the end (delta: -67.8 MB). Peak memory consumption was 124.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L28] int x = __VERIFIER_nondet_int(); [L29] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L17] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L19] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L17] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L19] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L17] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L19] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L17] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L19] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L17] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L19] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L17] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L19] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L17] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L19] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L22] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L17] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L19] COND TRUE n == 1 [L20] return 1; VAL [\old(n)=1, \result=1, n=1] [L22] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L22] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L17] COND TRUE n < 1 [L18] return 0; VAL [\old(n)=0, \result=0, n=0] [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L22] return fibonacci(n-1) + fibonacci(n-2); [L22] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L22] return fibonacci(n-1) + fibonacci(n-2); [L29] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L29] int result = fibonacci(x); [L30] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L33] CALL reach_error() [L3] __assert_fail("0", "Fibonacci05.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.8s, OverallIterations: 10, TraceHistogramMax: 67, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 193 SDtfs, 645 SDslu, 293 SDs, 0 SdLazy, 1619 SolverSat, 602 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1055 SyntacticMatches, 3 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2154 NumberOfCodeBlocks, 1921 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 1673 ConstructedInterpolants, 0 QuantifiedInterpolants, 509537 SizeOfPredicates, 40 NumberOfNonLiveVariables, 1673 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 12893/17130 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...