/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc config/AutomizerReach.xml -s config/svcomp-Reach-64bit-Automizer_Default.epf -i ../sv-benchmarks/c/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-bitabs-dcfa08f [2020-12-23 09:21:53,318 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-23 09:21:53,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-23 09:21:53,373 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-23 09:21:53,374 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-23 09:21:53,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-23 09:21:53,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-23 09:21:53,387 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-23 09:21:53,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-23 09:21:53,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-23 09:21:53,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-23 09:21:53,403 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-23 09:21:53,404 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-23 09:21:53,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-23 09:21:53,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-23 09:21:53,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-23 09:21:53,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-23 09:21:53,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-23 09:21:53,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-23 09:21:53,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-23 09:21:53,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-23 09:21:53,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-23 09:21:53,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-23 09:21:53,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-23 09:21:53,442 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-23 09:21:53,443 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-23 09:21:53,443 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-23 09:21:53,444 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-23 09:21:53,445 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-23 09:21:53,446 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-23 09:21:53,446 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-23 09:21:53,447 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-23 09:21:53,448 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-23 09:21:53,449 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-23 09:21:53,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-23 09:21:53,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-23 09:21:53,452 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-23 09:21:53,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-23 09:21:53,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-23 09:21:53,454 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-23 09:21:53,454 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-23 09:21:53,455 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2020-12-23 09:21:53,491 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-23 09:21:53,491 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-23 09:21:53,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-23 09:21:53,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-23 09:21:53,495 INFO L138 SettingsManager]: * Use SBE=true [2020-12-23 09:21:53,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-23 09:21:53,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-23 09:21:53,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-23 09:21:53,496 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-23 09:21:53,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-23 09:21:53,496 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-23 09:21:53,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-23 09:21:53,497 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-23 09:21:53,497 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-23 09:21:53,497 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-23 09:21:53,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-23 09:21:53,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-23 09:21:53,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:21:53,498 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-23 09:21:53,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-23 09:21:53,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-23 09:21:53,499 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-23 09:21:53,499 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-23 09:21:53,500 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-23 09:21:53,500 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-23 09:21:53,500 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-bitabs/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-12-23 09:21:53,904 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-23 09:21:53,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-23 09:21:53,936 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-23 09:21:53,937 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-23 09:21:53,938 INFO L275 PluginConnector]: CDTParser initialized [2020-12-23 09:21:53,939 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_10-1.c [2020-12-23 09:21:54,023 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8f6230f8f/70966cd863ef42f4b011785130ea1ea9/FLAG5bbb3ff75 [2020-12-23 09:21:54,587 INFO L306 CDTParser]: Found 1 translation units. [2020-12-23 09:21:54,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c [2020-12-23 09:21:54,595 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8f6230f8f/70966cd863ef42f4b011785130ea1ea9/FLAG5bbb3ff75 [2020-12-23 09:21:54,976 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/data/8f6230f8f/70966cd863ef42f4b011785130ea1ea9 [2020-12-23 09:21:54,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-23 09:21:54,985 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-23 09:21:54,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-23 09:21:54,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-23 09:21:54,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-23 09:21:54,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:21:54" (1/1) ... [2020-12-23 09:21:54,996 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e97f800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:54, skipping insertion in model container [2020-12-23 09:21:54,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 09:21:54" (1/1) ... [2020-12-23 09:21:55,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-23 09:21:55,020 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-23 09:21:55,179 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2020-12-23 09:21:55,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:21:55,196 INFO L203 MainTranslator]: Completed pre-run [2020-12-23 09:21:55,214 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-bitabs/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_10-1.c[743,756] [2020-12-23 09:21:55,215 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-23 09:21:55,235 INFO L208 MainTranslator]: Completed translation [2020-12-23 09:21:55,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55 WrapperNode [2020-12-23 09:21:55,235 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-23 09:21:55,239 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-23 09:21:55,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-23 09:21:55,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-23 09:21:55,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,289 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-23 09:21:55,294 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-23 09:21:55,294 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-23 09:21:55,295 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-23 09:21:55,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,307 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,317 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... [2020-12-23 09:21:55,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-23 09:21:55,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-23 09:21:55,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-23 09:21:55,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-23 09:21:55,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (1/1) ... No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-23 09:21:55,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-23 09:21:55,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-23 09:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-23 09:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-23 09:21:55,460 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-12-23 09:21:55,461 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-12-23 09:21:55,859 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-23 09:21:55,859 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2020-12-23 09:21:55,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:21:55 BoogieIcfgContainer [2020-12-23 09:21:55,861 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-23 09:21:55,863 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-23 09:21:55,863 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-23 09:21:55,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-23 09:21:55,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 09:21:54" (1/3) ... [2020-12-23 09:21:55,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e95e3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:21:55, skipping insertion in model container [2020-12-23 09:21:55,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 09:21:55" (2/3) ... [2020-12-23 09:21:55,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e95e3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 09:21:55, skipping insertion in model container [2020-12-23 09:21:55,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:21:55" (3/3) ... [2020-12-23 09:21:55,871 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-12-23 09:21:55,879 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-23 09:21:55,885 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-23 09:21:55,965 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-23 09:21:56,043 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-23 09:21:56,043 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-23 09:21:56,043 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-23 09:21:56,044 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-23 09:21:56,044 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-23 09:21:56,044 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-23 09:21:56,044 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-23 09:21:56,044 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-23 09:21:56,061 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-12-23 09:21:56,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-23 09:21:56,067 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:56,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:56,069 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:56,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1755511548, now seen corresponding path program 1 times [2020-12-23 09:21:56,086 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:56,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160480153] [2020-12-23 09:21:56,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:21:56,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160480153] [2020-12-23 09:21:56,356 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:21:56,356 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:21:56,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100752496] [2020-12-23 09:21:56,363 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:21:56,363 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:56,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:21:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:21:56,382 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 5 states. [2020-12-23 09:21:56,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:56,443 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-12-23 09:21:56,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:21:56,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-12-23 09:21:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:56,456 INFO L225 Difference]: With dead ends: 34 [2020-12-23 09:21:56,457 INFO L226 Difference]: Without dead ends: 18 [2020-12-23 09:21:56,461 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:21:56,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-12-23 09:21:56,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-12-23 09:21:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-23 09:21:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-23 09:21:56,506 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-12-23 09:21:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:56,506 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-23 09:21:56,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:21:56,507 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-23 09:21:56,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-23 09:21:56,508 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:56,509 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:56,509 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-23 09:21:56,509 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:56,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:56,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2128459596, now seen corresponding path program 1 times [2020-12-23 09:21:56,511 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:56,511 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686717175] [2020-12-23 09:21:56,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-23 09:21:56,598 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686717175] [2020-12-23 09:21:56,598 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-23 09:21:56,599 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-23 09:21:56,599 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99574163] [2020-12-23 09:21:56,600 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-23 09:21:56,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:56,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-23 09:21:56,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:21:56,602 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-12-23 09:21:56,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:56,634 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-12-23 09:21:56,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-23 09:21:56,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-23 09:21:56,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:56,637 INFO L225 Difference]: With dead ends: 24 [2020-12-23 09:21:56,637 INFO L226 Difference]: Without dead ends: 20 [2020-12-23 09:21:56,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-23 09:21:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-23 09:21:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-12-23 09:21:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-12-23 09:21:56,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-12-23 09:21:56,646 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-12-23 09:21:56,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:56,646 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-12-23 09:21:56,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-23 09:21:56,647 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-12-23 09:21:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-23 09:21:56,648 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:56,648 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:56,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-23 09:21:56,649 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:56,650 INFO L82 PathProgramCache]: Analyzing trace with hash -42544313, now seen corresponding path program 1 times [2020-12-23 09:21:56,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:56,651 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454492542] [2020-12-23 09:21:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-12-23 09:21:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,877 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:21:56,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454492542] [2020-12-23 09:21:56,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618478823] [2020-12-23 09:21:56,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:56,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:56,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 09:21:56,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:21:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-12-23 09:21:57,133 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:21:57,134 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-12-23 09:21:57,134 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616076554] [2020-12-23 09:21:57,135 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-12-23 09:21:57,135 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:57,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-12-23 09:21:57,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:21:57,137 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-12-23 09:21:57,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:57,282 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-12-23 09:21:57,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-23 09:21:57,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-12-23 09:21:57,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:57,285 INFO L225 Difference]: With dead ends: 35 [2020-12-23 09:21:57,285 INFO L226 Difference]: Without dead ends: 20 [2020-12-23 09:21:57,286 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:21:57,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-12-23 09:21:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-12-23 09:21:57,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-12-23 09:21:57,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-12-23 09:21:57,294 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-12-23 09:21:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:57,294 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-12-23 09:21:57,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-12-23 09:21:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-12-23 09:21:57,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-23 09:21:57,296 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:57,297 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:57,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-12-23 09:21:57,512 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:57,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:57,514 INFO L82 PathProgramCache]: Analyzing trace with hash 170813287, now seen corresponding path program 1 times [2020-12-23 09:21:57,514 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:57,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026089621] [2020-12-23 09:21:57,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:57,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:57,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:57,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:57,644 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:21:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:57,655 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:21:57,655 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026089621] [2020-12-23 09:21:57,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427129470] [2020-12-23 09:21:57,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:57,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:57,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-12-23 09:21:57,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:21:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-12-23 09:21:57,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:21:57,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-12-23 09:21:57,790 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496594500] [2020-12-23 09:21:57,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-23 09:21:57,791 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:57,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-23 09:21:57,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2020-12-23 09:21:57,793 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 8 states. [2020-12-23 09:21:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:57,892 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-12-23 09:21:57,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-23 09:21:57,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-23 09:21:57,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:57,896 INFO L225 Difference]: With dead ends: 38 [2020-12-23 09:21:57,896 INFO L226 Difference]: Without dead ends: 34 [2020-12-23 09:21:57,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-12-23 09:21:57,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-12-23 09:21:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-12-23 09:21:57,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-12-23 09:21:57,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-12-23 09:21:57,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-12-23 09:21:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:57,908 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-12-23 09:21:57,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-23 09:21:57,908 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-12-23 09:21:57,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-12-23 09:21:57,910 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:57,911 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:58,114 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:58,115 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:58,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:58,116 INFO L82 PathProgramCache]: Analyzing trace with hash -187634876, now seen corresponding path program 2 times [2020-12-23 09:21:58,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:58,117 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779138495] [2020-12-23 09:21:58,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,169 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:21:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:21:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-12-23 09:21:58,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779138495] [2020-12-23 09:21:58,302 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048424670] [2020-12-23 09:21:58,303 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:58,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 09:21:58,366 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:21:58,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 09:21:58,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:21:58,524 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-12-23 09:21:58,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:21:58,525 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-12-23 09:21:58,525 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847061218] [2020-12-23 09:21:58,526 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:21:58,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:21:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:21:58,527 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 13 states. [2020-12-23 09:21:58,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:58,820 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-12-23 09:21:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-23 09:21:58,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2020-12-23 09:21:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:58,823 INFO L225 Difference]: With dead ends: 69 [2020-12-23 09:21:58,823 INFO L226 Difference]: Without dead ends: 38 [2020-12-23 09:21:58,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:21:58,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-23 09:21:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-12-23 09:21:58,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-12-23 09:21:58,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-12-23 09:21:58,838 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-12-23 09:21:58,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:58,839 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-12-23 09:21:58,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:21:58,840 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-12-23 09:21:58,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-12-23 09:21:58,846 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:58,847 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:21:59,065 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:59,066 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:21:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:21:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash 366248375, now seen corresponding path program 3 times [2020-12-23 09:21:59,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:21:59,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023377683] [2020-12-23 09:21:59,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:21:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:21:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:59,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:21:59,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:21:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:21:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:21:59,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:21:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,382 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:21:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:21:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-12-23 09:21:59,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023377683] [2020-12-23 09:21:59,401 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [244121903] [2020-12-23 09:21:59,401 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:21:59,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-12-23 09:21:59,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:21:59,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-12-23 09:21:59,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:21:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-12-23 09:21:59,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:21:59,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 13 [2020-12-23 09:21:59,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795587476] [2020-12-23 09:21:59,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-23 09:21:59,606 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:21:59,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-23 09:21:59,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-12-23 09:21:59,607 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 13 states. [2020-12-23 09:21:59,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:21:59,909 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-12-23 09:21:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-23 09:21:59,910 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2020-12-23 09:21:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:21:59,914 INFO L225 Difference]: With dead ends: 94 [2020-12-23 09:21:59,915 INFO L226 Difference]: Without dead ends: 90 [2020-12-23 09:21:59,916 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-23 09:21:59,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-12-23 09:21:59,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-12-23 09:21:59,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-12-23 09:21:59,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-12-23 09:21:59,939 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-12-23 09:21:59,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:21:59,940 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-12-23 09:21:59,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-23 09:21:59,940 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-12-23 09:21:59,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2020-12-23 09:21:59,945 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:21:59,945 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:00,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:00,161 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:00,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1022210831, now seen corresponding path program 4 times [2020-12-23 09:22:00,162 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:00,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546392139] [2020-12-23 09:22:00,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:00,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:22:00,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,365 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,418 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:00,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,564 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,567 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,576 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:00,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,596 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,779 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:00,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:00,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:01,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 403 proven. 706 refuted. 0 times theorem prover too weak. 1471 trivial. 0 not checked. [2020-12-23 09:22:01,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546392139] [2020-12-23 09:22:01,055 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1053700081] [2020-12-23 09:22:01,055 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:01,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-12-23 09:22:01,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:22:01,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 09:22:01,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:22:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 108 proven. 716 refuted. 0 times theorem prover too weak. 1756 trivial. 0 not checked. [2020-12-23 09:22:01,594 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:22:01,594 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10] total 22 [2020-12-23 09:22:01,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460964409] [2020-12-23 09:22:01,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-23 09:22:01,602 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:22:01,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-23 09:22:01,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2020-12-23 09:22:01,605 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 22 states. [2020-12-23 09:22:02,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:22:02,254 INFO L93 Difference]: Finished difference Result 170 states and 315 transitions. [2020-12-23 09:22:02,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-12-23 09:22:02,254 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 215 [2020-12-23 09:22:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:22:02,258 INFO L225 Difference]: With dead ends: 170 [2020-12-23 09:22:02,258 INFO L226 Difference]: Without dead ends: 87 [2020-12-23 09:22:02,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 310 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2020-12-23 09:22:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-12-23 09:22:02,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 77. [2020-12-23 09:22:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2020-12-23 09:22:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 106 transitions. [2020-12-23 09:22:02,283 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 106 transitions. Word has length 215 [2020-12-23 09:22:02,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:22:02,283 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 106 transitions. [2020-12-23 09:22:02,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-23 09:22:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 106 transitions. [2020-12-23 09:22:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-12-23 09:22:02,293 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:22:02,293 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:02,510 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-12-23 09:22:02,511 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:02,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:02,512 INFO L82 PathProgramCache]: Analyzing trace with hash 1099173212, now seen corresponding path program 5 times [2020-12-23 09:22:02,512 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:02,513 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514257438] [2020-12-23 09:22:02,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:22:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,931 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:02,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,005 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:03,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,177 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,197 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:03,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,217 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:03,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-12-23 09:22:03,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514257438] [2020-12-23 09:22:03,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249049302] [2020-12-23 09:22:03,417 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/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-12-23 09:22:03,649 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 41 check-sat command(s) [2020-12-23 09:22:03,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:22:03,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 658 conjuncts, 14 conjunts are in the unsatisfiable core [2020-12-23 09:22:03,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:22:04,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 801 proven. 327 refuted. 0 times theorem prover too weak. 3440 trivial. 0 not checked. [2020-12-23 09:22:04,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:22:04,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 19 [2020-12-23 09:22:04,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175073725] [2020-12-23 09:22:04,092 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-12-23 09:22:04,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:22:04,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-12-23 09:22:04,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2020-12-23 09:22:04,093 INFO L87 Difference]: Start difference. First operand 77 states and 106 transitions. Second operand 19 states. [2020-12-23 09:22:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:22:04,409 INFO L93 Difference]: Finished difference Result 170 states and 293 transitions. [2020-12-23 09:22:04,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-23 09:22:04,411 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 283 [2020-12-23 09:22:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:22:04,421 INFO L225 Difference]: With dead ends: 170 [2020-12-23 09:22:04,422 INFO L226 Difference]: Without dead ends: 101 [2020-12-23 09:22:04,423 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 362 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=272, Unknown=0, NotChecked=0, Total=420 [2020-12-23 09:22:04,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-12-23 09:22:04,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 90. [2020-12-23 09:22:04,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-12-23 09:22:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 131 transitions. [2020-12-23 09:22:04,465 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 131 transitions. Word has length 283 [2020-12-23 09:22:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:22:04,466 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 131 transitions. [2020-12-23 09:22:04,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-12-23 09:22:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 131 transitions. [2020-12-23 09:22:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2020-12-23 09:22:04,483 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:22:04,484 INFO L422 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:04,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:04,698 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:04,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:04,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1550468663, now seen corresponding path program 6 times [2020-12-23 09:22:04,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:04,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81079225] [2020-12-23 09:22:04,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:22:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,460 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,590 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,748 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,802 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:05,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:05,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,926 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,939 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:05,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:05,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:05,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-23 09:22:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,320 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,326 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,332 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,402 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,409 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:06,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,435 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:06,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,446 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,451 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,455 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,457 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,507 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,533 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,537 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,541 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:06,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:07,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1691 proven. 3390 refuted. 0 times theorem prover too weak. 14022 trivial. 0 not checked. [2020-12-23 09:22:07,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81079225] [2020-12-23 09:22:07,038 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422744351] [2020-12-23 09:22:07,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-bitabs/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-12-23 09:22:07,202 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-12-23 09:22:07,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:22:07,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-23 09:22:07,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:22:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 709 proven. 2234 refuted. 0 times theorem prover too weak. 16160 trivial. 0 not checked. [2020-12-23 09:22:07,877 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:22:07,877 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 11] total 30 [2020-12-23 09:22:07,877 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127172532] [2020-12-23 09:22:07,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-12-23 09:22:07,879 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:22:07,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-12-23 09:22:07,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=681, Unknown=0, NotChecked=0, Total=870 [2020-12-23 09:22:07,881 INFO L87 Difference]: Start difference. First operand 90 states and 131 transitions. Second operand 30 states. [2020-12-23 09:22:08,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:22:08,893 INFO L93 Difference]: Finished difference Result 210 states and 401 transitions. [2020-12-23 09:22:08,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-12-23 09:22:08,894 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 569 [2020-12-23 09:22:08,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:22:08,897 INFO L225 Difference]: With dead ends: 210 [2020-12-23 09:22:08,897 INFO L226 Difference]: Without dead ends: 131 [2020-12-23 09:22:08,900 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 784 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 727 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=558, Invalid=2094, Unknown=0, NotChecked=0, Total=2652 [2020-12-23 09:22:08,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2020-12-23 09:22:08,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2020-12-23 09:22:08,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2020-12-23 09:22:08,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2020-12-23 09:22:08,917 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 569 [2020-12-23 09:22:08,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:22:08,917 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2020-12-23 09:22:08,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-12-23 09:22:08,918 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2020-12-23 09:22:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2020-12-23 09:22:08,940 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:22:08,940 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:09,153 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:09,154 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:09,155 INFO L82 PathProgramCache]: Analyzing trace with hash -861966516, now seen corresponding path program 7 times [2020-12-23 09:22:09,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:09,156 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164461462] [2020-12-23 09:22:09,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:09,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:22:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,661 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:10,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,672 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,675 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,692 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,694 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,708 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,734 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:10,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,771 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:10,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,842 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:10,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:10,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-23 09:22:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,078 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,155 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:11,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,519 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-23 09:22:11,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,656 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,663 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,667 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,671 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,673 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,682 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,686 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,699 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,716 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,718 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,724 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,754 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,775 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,784 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,788 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,791 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:11,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:11,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:11,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-23 09:22:12,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164461462] [2020-12-23 09:22:12,682 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351104813] [2020-12-23 09:22:12,682 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:12,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 1686 conjuncts, 20 conjunts are in the unsatisfiable core [2020-12-23 09:22:12,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:22:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-12-23 09:22:13,841 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:22:13,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 13] total 22 [2020-12-23 09:22:13,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118529570] [2020-12-23 09:22:13,843 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-12-23 09:22:13,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:22:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-12-23 09:22:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=304, Unknown=0, NotChecked=0, Total=462 [2020-12-23 09:22:13,844 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand 22 states. [2020-12-23 09:22:14,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:22:14,175 INFO L93 Difference]: Finished difference Result 478 states and 748 transitions. [2020-12-23 09:22:14,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-12-23 09:22:14,176 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 746 [2020-12-23 09:22:14,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:22:14,185 INFO L225 Difference]: With dead ends: 478 [2020-12-23 09:22:14,185 INFO L226 Difference]: Without dead ends: 474 [2020-12-23 09:22:14,187 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 984 GetRequests, 963 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=327, Unknown=0, NotChecked=0, Total=506 [2020-12-23 09:22:14,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2020-12-23 09:22:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 453. [2020-12-23 09:22:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-12-23 09:22:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 703 transitions. [2020-12-23 09:22:14,240 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 703 transitions. Word has length 746 [2020-12-23 09:22:14,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:22:14,241 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 703 transitions. [2020-12-23 09:22:14,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-12-23 09:22:14,241 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 703 transitions. [2020-12-23 09:22:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1496 [2020-12-23 09:22:14,263 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:22:14,264 INFO L422 BasicCegarLoop]: trace histogram [219, 219, 177, 109, 109, 109, 109, 109, 109, 109, 68, 42, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:14,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-12-23 09:22:14,479 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:14,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:14,480 INFO L82 PathProgramCache]: Analyzing trace with hash -670718281, now seen corresponding path program 8 times [2020-12-23 09:22:14,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:14,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680591108] [2020-12-23 09:22:14,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:16,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-12-23 09:22:16,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,558 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:17,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:17,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,161 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,265 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,267 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,290 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,293 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:18,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,311 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,314 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,317 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-23 09:22:18,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,450 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,464 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,468 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,471 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,488 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:18,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,502 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,506 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,511 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,554 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-23 09:22:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,969 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,976 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,980 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:18,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:19,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,032 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,038 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:19,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:19,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,062 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:19,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2020-12-23 09:22:19,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:19,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,231 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,359 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,398 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,412 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,415 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,504 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,522 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,556 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,561 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,563 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:20,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,622 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,634 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,637 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:20,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,642 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,658 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-12-23 09:22:20,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,803 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,812 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,824 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,832 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,844 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:20,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,872 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:20,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-12-23 09:22:21,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,096 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:21,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:21,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-12-23 09:22:21,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:21,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-12-23 09:22:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,232 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-12-23 09:22:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,248 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-12-23 09:22:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-12-23 09:22:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-12-23 09:22:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:21,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-12-23 09:22:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-23 09:22:23,340 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6145 proven. 13082 refuted. 0 times theorem prover too weak. 115377 trivial. 0 not checked. [2020-12-23 09:22:23,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680591108] [2020-12-23 09:22:23,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698751319] [2020-12-23 09:22:23,341 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-bitabs/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:23,922 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-12-23 09:22:23,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-12-23 09:22:23,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 3349 conjuncts, 22 conjunts are in the unsatisfiable core [2020-12-23 09:22:23,957 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-23 09:22:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 134604 backedges. 6930 proven. 4817 refuted. 0 times theorem prover too weak. 122857 trivial. 0 not checked. [2020-12-23 09:22:26,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-23 09:22:26,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 14] total 40 [2020-12-23 09:22:26,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31282377] [2020-12-23 09:22:26,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 40 states [2020-12-23 09:22:26,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-23 09:22:26,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2020-12-23 09:22:26,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=1240, Unknown=0, NotChecked=0, Total=1560 [2020-12-23 09:22:26,110 INFO L87 Difference]: Start difference. First operand 453 states and 703 transitions. Second operand 40 states. [2020-12-23 09:22:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-23 09:22:27,819 INFO L93 Difference]: Finished difference Result 670 states and 1318 transitions. [2020-12-23 09:22:27,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-12-23 09:22:27,820 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1495 [2020-12-23 09:22:27,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-23 09:22:27,826 INFO L225 Difference]: With dead ends: 670 [2020-12-23 09:22:27,827 INFO L226 Difference]: Without dead ends: 204 [2020-12-23 09:22:27,835 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2003 GetRequests, 1930 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1021, Invalid=4529, Unknown=0, NotChecked=0, Total=5550 [2020-12-23 09:22:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2020-12-23 09:22:27,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 157. [2020-12-23 09:22:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-12-23 09:22:27,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 212 transitions. [2020-12-23 09:22:27,852 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 212 transitions. Word has length 1495 [2020-12-23 09:22:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-23 09:22:27,854 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 212 transitions. [2020-12-23 09:22:27,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2020-12-23 09:22:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 212 transitions. [2020-12-23 09:22:27,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1210 [2020-12-23 09:22:27,873 INFO L414 BasicCegarLoop]: Found error trace [2020-12-23 09:22:27,874 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1] [2020-12-23 09:22:28,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-12-23 09:22:28,088 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-23 09:22:28,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-23 09:22:28,089 INFO L82 PathProgramCache]: Analyzing trace with hash 15284780, now seen corresponding path program 9 times [2020-12-23 09:22:28,090 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-23 09:22:28,090 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083425444] [2020-12-23 09:22:28,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-23 09:22:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:22:28,454 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:22:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-23 09:22:28,904 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-23 09:22:29,642 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-23 09:22:29,642 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-23 09:22:29,642 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-23 09:22:30,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 09:22:30 BoogieIcfgContainer [2020-12-23 09:22:30,031 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-23 09:22:30,032 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-23 09:22:30,032 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-23 09:22:30,032 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-23 09:22:30,033 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 09:21:55" (3/4) ... [2020-12-23 09:22:30,038 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-23 09:22:30,420 INFO L141 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/recursive-simple/fibo_10-1.c-witness.graphml [2020-12-23 09:22:30,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-23 09:22:30,423 INFO L168 Benchmark]: Toolchain (without parser) took 35437.56 ms. Allocated memory was 157.3 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 133.4 MB in the beginning and 1.5 GB in the end (delta: -1.3 GB). Peak memory consumption was 148.8 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,424 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:22:30,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 246.19 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 123.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 157.3 MB. Free memory was 123.9 MB in the beginning and 122.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,425 INFO L168 Benchmark]: Boogie Preprocessor took 36.62 ms. Allocated memory is still 157.3 MB. Free memory was 122.6 MB in the beginning and 121.7 MB in the end (delta: 878.7 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-12-23 09:22:30,426 INFO L168 Benchmark]: RCFGBuilder took 528.71 ms. Allocated memory is still 157.3 MB. Free memory was 121.7 MB in the beginning and 110.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,426 INFO L168 Benchmark]: TraceAbstraction took 34168.19 ms. Allocated memory was 157.3 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 109.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 976.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,427 INFO L168 Benchmark]: Witness Printer took 389.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 47.9 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. [2020-12-23 09:22:30,429 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 157.3 MB. Free memory is still 129.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 246.19 ms. Allocated memory is still 157.3 MB. Free memory was 133.2 MB in the beginning and 123.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 157.3 MB. Free memory was 123.9 MB in the beginning and 122.6 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 36.62 ms. Allocated memory is still 157.3 MB. Free memory was 122.6 MB in the beginning and 121.7 MB in the end (delta: 878.7 kB). There was no memory consumed. Max. memory is 8.0 GB. * RCFGBuilder took 528.71 ms. Allocated memory is still 157.3 MB. Free memory was 121.7 MB in the beginning and 110.0 MB in the end (delta: 11.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 34168.19 ms. Allocated memory was 157.3 MB in the beginning and 1.6 GB in the end (delta: 1.5 GB). Free memory was 109.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 976.2 MB. Max. memory is 8.0 GB. * Witness Printer took 389.02 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 47.9 MB). Peak memory consumption was 48.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 29]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] int x = 10; [L27] CALL, EXPR fibo(x) VAL [\old(n)=10] [L8] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L10] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L8] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L10] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 55 [L29] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 33.6s, OverallIterations: 12, TraceHistogramMax: 219, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 243 SDtfs, 1122 SDslu, 944 SDs, 0 SdLazy, 2728 SolverSat, 1345 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4730 GetRequests, 4477 SyntacticMatches, 2 SemanticMatches, 251 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=10, 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, 11 MinimizatonAttempts, 112 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 8172 NumberOfCodeBlocks, 7690 NumberOfCodeBlocksAsserted, 88 NumberOfCheckSat, 6943 ConstructedInterpolants, 0 QuantifiedInterpolants, 7888801 SizeOfPredicates, 57 NumberOfNonLiveVariables, 6852 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 353268/388638 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...