/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-23 17:59:57,310 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-23 17:59:57,313 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-23 17:59:57,350 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-23 17:59:57,351 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-23 17:59:57,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-23 17:59:57,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-23 17:59:57,357 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-23 17:59:57,359 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-23 17:59:57,360 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-23 17:59:57,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-23 17:59:57,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-23 17:59:57,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-23 17:59:57,365 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-23 17:59:57,366 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-23 17:59:57,368 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-23 17:59:57,369 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-23 17:59:57,370 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-23 17:59:57,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-23 17:59:57,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-23 17:59:57,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-23 17:59:57,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-23 17:59:57,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-23 17:59:57,382 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-23 17:59:57,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-23 17:59:57,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-23 17:59:57,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-23 17:59:57,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-23 17:59:57,388 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-23 17:59:57,389 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-23 17:59:57,389 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-23 17:59:57,390 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-23 17:59:57,391 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-23 17:59:57,392 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-23 17:59:57,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-23 17:59:57,394 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-23 17:59:57,395 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-23 17:59:57,395 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-23 17:59:57,396 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-23 17:59:57,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-23 17:59:57,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-23 17:59:57,401 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-23 17:59:57,460 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-23 17:59:57,461 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-23 17:59:57,463 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-23 17:59:57,464 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-23 17:59:57,464 INFO L138 SettingsManager]: * Use SBE=true [2020-10-23 17:59:57,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-23 17:59:57,465 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-23 17:59:57,465 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-23 17:59:57,466 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-23 17:59:57,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-23 17:59:57,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-23 17:59:57,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-23 17:59:57,466 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-23 17:59:57,467 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-23 17:59:57,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-23 17:59:57,468 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-23 17:59:57,468 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-23 17:59:57,468 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-23 17:59:57,469 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-23 17:59:57,469 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-23 17:59:57,469 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-23 17:59:57,469 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 17:59:57,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-23 17:59:57,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-23 17:59:57,470 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-23 17:59:57,470 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-23 17:59:57,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-23 17:59:57,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-23 17:59:57,471 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-23 17:59:57,471 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-10-23 17:59:57,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-23 17:59:57,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-23 17:59:57,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-23 17:59:57,951 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-23 17:59:57,952 INFO L275 PluginConnector]: CDTParser initialized [2020-10-23 17:59:57,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-10-23 17:59:58,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d05fdf/4eadaa5a4c7a43768165490741fac4c9/FLAGbb90a45cf [2020-10-23 17:59:58,666 INFO L306 CDTParser]: Found 1 translation units. [2020-10-23 17:59:58,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-10-23 17:59:58,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d05fdf/4eadaa5a4c7a43768165490741fac4c9/FLAGbb90a45cf [2020-10-23 17:59:59,030 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/768d05fdf/4eadaa5a4c7a43768165490741fac4c9 [2020-10-23 17:59:59,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-23 17:59:59,046 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-23 17:59:59,050 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-23 17:59:59,051 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-23 17:59:59,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-23 17:59:59,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4ef0a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59, skipping insertion in model container [2020-10-23 17:59:59,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,073 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-23 17:59:59,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-23 17:59:59,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 17:59:59,339 INFO L203 MainTranslator]: Completed pre-run [2020-10-23 17:59:59,354 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-23 17:59:59,369 INFO L208 MainTranslator]: Completed translation [2020-10-23 17:59:59,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59 WrapperNode [2020-10-23 17:59:59,370 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-23 17:59:59,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-23 17:59:59,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-23 17:59:59,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-23 17:59:59,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,400 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,402 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,403 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... [2020-10-23 17:59:59,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-23 17:59:59,406 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-23 17:59:59,406 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-23 17:59:59,406 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-23 17:59:59,408 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-23 17:59:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-23 17:59:59,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-23 17:59:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-23 17:59:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-23 17:59:59,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-23 17:59:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-23 17:59:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-23 17:59:59,490 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-23 17:59:59,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-23 17:59:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-23 17:59:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-23 17:59:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-23 17:59:59,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-23 17:59:59,881 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-23 17:59:59,881 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-23 17:59:59,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:59:59 BoogieIcfgContainer [2020-10-23 17:59:59,885 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-23 17:59:59,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-23 17:59:59,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-23 17:59:59,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-23 17:59:59,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.10 05:59:59" (1/3) ... [2020-10-23 17:59:59,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795d7c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:59:59, skipping insertion in model container [2020-10-23 17:59:59,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.10 05:59:59" (2/3) ... [2020-10-23 17:59:59,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795d7c30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.10 05:59:59, skipping insertion in model container [2020-10-23 17:59:59,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.10 05:59:59" (3/3) ... [2020-10-23 17:59:59,905 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-10-23 17:59:59,924 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-23 17:59:59,929 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-23 17:59:59,943 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-23 17:59:59,970 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-23 17:59:59,971 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-23 17:59:59,971 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-23 17:59:59,971 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-23 17:59:59,971 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-23 17:59:59,971 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-23 17:59:59,971 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-23 17:59:59,971 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-23 17:59:59,989 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-23 17:59:59,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-23 17:59:59,995 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 17:59:59,996 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 17:59:59,997 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:00,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:00,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1708859500, now seen corresponding path program 1 times [2020-10-23 18:00:00,017 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:00,017 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045000044] [2020-10-23 18:00:00,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:00,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,294 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:00,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:00:00,341 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045000044] [2020-10-23 18:00:00,342 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:00:00,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:00:00,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849426162] [2020-10-23 18:00:00,348 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:00:00,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:00:00,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:00:00,367 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 6 states. [2020-10-23 18:00:00,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:00,647 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2020-10-23 18:00:00,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:00:00,649 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2020-10-23 18:00:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:00,659 INFO L225 Difference]: With dead ends: 44 [2020-10-23 18:00:00,659 INFO L226 Difference]: Without dead ends: 23 [2020-10-23 18:00:00,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:00:00,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-10-23 18:00:00,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-10-23 18:00:00,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 18:00:00,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 18:00:00,713 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2020-10-23 18:00:00,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:00,714 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 18:00:00,714 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:00:00,714 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 18:00:00,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-23 18:00:00,716 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:00,716 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:00,717 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-23 18:00:00,717 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:00,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:00,718 INFO L82 PathProgramCache]: Analyzing trace with hash 2119969838, now seen corresponding path program 1 times [2020-10-23 18:00:00,718 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:00,719 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269580261] [2020-10-23 18:00:00,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-23 18:00:00,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269580261] [2020-10-23 18:00:00,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-23 18:00:00,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-23 18:00:00,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400709071] [2020-10-23 18:00:00,877 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-23 18:00:00,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:00,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-23 18:00:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-23 18:00:00,879 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2020-10-23 18:00:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:01,237 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2020-10-23 18:00:01,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-23 18:00:01,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-23 18:00:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:01,239 INFO L225 Difference]: With dead ends: 30 [2020-10-23 18:00:01,240 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 18:00:01,245 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-23 18:00:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 18:00:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2020-10-23 18:00:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-10-23 18:00:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-10-23 18:00:01,260 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2020-10-23 18:00:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:01,261 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-10-23 18:00:01,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-23 18:00:01,261 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-10-23 18:00:01,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-23 18:00:01,263 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:01,263 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:01,264 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-23 18:00:01,264 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:01,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:01,265 INFO L82 PathProgramCache]: Analyzing trace with hash -308126725, now seen corresponding path program 1 times [2020-10-23 18:00:01,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:01,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551512287] [2020-10-23 18:00:01,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,410 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:01,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:01,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-23 18:00:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,546 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 18:00:01,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551512287] [2020-10-23 18:00:01,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706035926] [2020-10-23 18:00:01,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:01,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:00:01,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:01,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-23 18:00:01,742 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:01,742 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 10 [2020-10-23 18:00:01,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053121564] [2020-10-23 18:00:01,743 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-23 18:00:01,743 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:01,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-23 18:00:01,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-10-23 18:00:01,745 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 10 states. [2020-10-23 18:00:02,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:02,125 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-23 18:00:02,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-23 18:00:02,126 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2020-10-23 18:00:02,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:02,128 INFO L225 Difference]: With dead ends: 41 [2020-10-23 18:00:02,128 INFO L226 Difference]: Without dead ends: 25 [2020-10-23 18:00:02,129 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2020-10-23 18:00:02,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-23 18:00:02,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-23 18:00:02,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-23 18:00:02,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2020-10-23 18:00:02,138 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 28 [2020-10-23 18:00:02,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:02,138 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2020-10-23 18:00:02,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-23 18:00:02,139 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2020-10-23 18:00:02,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-23 18:00:02,140 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:02,140 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:02,354 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-23 18:00:02,355 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:02,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1144313053, now seen corresponding path program 1 times [2020-10-23 18:00:02,357 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:02,357 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049051494] [2020-10-23 18:00:02,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,462 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,520 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,560 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,576 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:00:02,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049051494] [2020-10-23 18:00:02,577 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832501246] [2020-10-23 18:00:02,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:02,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-23 18:00:02,639 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:02,678 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-23 18:00:02,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:02,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2020-10-23 18:00:02,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847847936] [2020-10-23 18:00:02,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-23 18:00:02,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-23 18:00:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-10-23 18:00:02,681 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand 8 states. [2020-10-23 18:00:03,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:03,079 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2020-10-23 18:00:03,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-23 18:00:03,080 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-10-23 18:00:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:03,083 INFO L225 Difference]: With dead ends: 44 [2020-10-23 18:00:03,083 INFO L226 Difference]: Without dead ends: 39 [2020-10-23 18:00:03,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:00:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-23 18:00:03,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2020-10-23 18:00:03,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-23 18:00:03,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-10-23 18:00:03,111 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 29 [2020-10-23 18:00:03,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:03,112 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-10-23 18:00:03,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-23 18:00:03,112 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2020-10-23 18:00:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-10-23 18:00:03,118 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:03,118 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:03,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:03,329 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:03,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:03,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1249611306, now seen corresponding path program 2 times [2020-10-23 18:00:03,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:03,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735732746] [2020-10-23 18:00:03,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:03,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,574 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,581 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,592 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:03,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:03,639 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-23 18:00:03,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735732746] [2020-10-23 18:00:03,639 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766878563] [2020-10-23 18:00:03,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:03,719 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:00:03,719 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:03,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 18:00:03,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:03,838 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-23 18:00:03,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:03,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-10-23 18:00:03,839 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422215554] [2020-10-23 18:00:03,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 18:00:03,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:03,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 18:00:03,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:00:03,841 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand 13 states. [2020-10-23 18:00:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:04,816 INFO L93 Difference]: Finished difference Result 75 states and 112 transitions. [2020-10-23 18:00:04,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-23 18:00:04,821 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2020-10-23 18:00:04,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:04,823 INFO L225 Difference]: With dead ends: 75 [2020-10-23 18:00:04,823 INFO L226 Difference]: Without dead ends: 43 [2020-10-23 18:00:04,825 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2020-10-23 18:00:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-23 18:00:04,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-23 18:00:04,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-23 18:00:04,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2020-10-23 18:00:04,836 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2020-10-23 18:00:04,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:04,837 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2020-10-23 18:00:04,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 18:00:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2020-10-23 18:00:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-10-23 18:00:04,840 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:04,840 INFO L422 BasicCegarLoop]: trace histogram [13, 13, 11, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:05,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:05,055 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:05,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:05,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1158728484, now seen corresponding path program 3 times [2020-10-23 18:00:05,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:05,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463464125] [2020-10-23 18:00:05,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,136 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:05,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,235 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,303 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:05,346 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 27 proven. 166 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2020-10-23 18:00:05,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463464125] [2020-10-23 18:00:05,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738305758] [2020-10-23 18:00:05,347 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:05,441 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-23 18:00:05,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:05,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-23 18:00:05,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:05,595 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 174 proven. 17 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2020-10-23 18:00:05,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:05,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2020-10-23 18:00:05,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910917300] [2020-10-23 18:00:05,599 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:00:05,599 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:05,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:00:05,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:00:05,602 INFO L87 Difference]: Start difference. First operand 43 states and 51 transitions. Second operand 14 states. [2020-10-23 18:00:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:06,740 INFO L93 Difference]: Finished difference Result 95 states and 139 transitions. [2020-10-23 18:00:06,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:00:06,741 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2020-10-23 18:00:06,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:06,745 INFO L225 Difference]: With dead ends: 95 [2020-10-23 18:00:06,745 INFO L226 Difference]: Without dead ends: 58 [2020-10-23 18:00:06,747 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=206, Invalid=664, Unknown=0, NotChecked=0, Total=870 [2020-10-23 18:00:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-23 18:00:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2020-10-23 18:00:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-23 18:00:06,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2020-10-23 18:00:06,762 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 98 [2020-10-23 18:00:06,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:06,763 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2020-10-23 18:00:06,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:00:06,763 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2020-10-23 18:00:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-10-23 18:00:06,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:06,768 INFO L422 BasicCegarLoop]: trace histogram [15, 15, 12, 7, 7, 7, 7, 7, 7, 7, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:06,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:06,982 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:06,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:06,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1296121057, now seen corresponding path program 4 times [2020-10-23 18:00:06,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:06,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170629145] [2020-10-23 18:00:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:07,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,255 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,308 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,325 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,341 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,346 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,351 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:07,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-23 18:00:07,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170629145] [2020-10-23 18:00:07,376 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97384060] [2020-10-23 18:00:07,376 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:07,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-23 18:00:07,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:07,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-23 18:00:07,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 570 backedges. 42 proven. 229 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2020-10-23 18:00:07,520 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:07,520 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2020-10-23 18:00:07,521 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755512295] [2020-10-23 18:00:07,522 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-23 18:00:07,522 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:07,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-23 18:00:07,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2020-10-23 18:00:07,523 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand 11 states. [2020-10-23 18:00:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:08,192 INFO L93 Difference]: Finished difference Result 128 states and 178 transitions. [2020-10-23 18:00:08,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-23 18:00:08,194 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 111 [2020-10-23 18:00:08,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:08,203 INFO L225 Difference]: With dead ends: 128 [2020-10-23 18:00:08,204 INFO L226 Difference]: Without dead ends: 123 [2020-10-23 18:00:08,205 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-10-23 18:00:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-10-23 18:00:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 114. [2020-10-23 18:00:08,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2020-10-23 18:00:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2020-10-23 18:00:08,261 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 111 [2020-10-23 18:00:08,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:08,263 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2020-10-23 18:00:08,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-23 18:00:08,264 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2020-10-23 18:00:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2020-10-23 18:00:08,276 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:08,276 INFO L422 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:08,490 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-23 18:00:08,491 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:08,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:08,492 INFO L82 PathProgramCache]: Analyzing trace with hash -732775580, now seen corresponding path program 5 times [2020-10-23 18:00:08,492 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:08,493 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985739018] [2020-10-23 18:00:08,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:08,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,707 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,750 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,875 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,912 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:08,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:08,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,967 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:08,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2020-10-23 18:00:09,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985739018] [2020-10-23 18:00:09,042 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162606364] [2020-10-23 18:00:09,043 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:09,180 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2020-10-23 18:00:09,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:09,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-23 18:00:09,203 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 328 proven. 115 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2020-10-23 18:00:09,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:09,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 12 [2020-10-23 18:00:09,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122194247] [2020-10-23 18:00:09,303 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-23 18:00:09,303 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:09,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-23 18:00:09,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-10-23 18:00:09,304 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand 12 states. [2020-10-23 18:00:10,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:10,157 INFO L93 Difference]: Finished difference Result 256 states and 390 transitions. [2020-10-23 18:00:10,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-23 18:00:10,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2020-10-23 18:00:10,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:10,166 INFO L225 Difference]: With dead ends: 256 [2020-10-23 18:00:10,166 INFO L226 Difference]: Without dead ends: 251 [2020-10-23 18:00:10,168 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=388, Unknown=0, NotChecked=0, Total=552 [2020-10-23 18:00:10,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2020-10-23 18:00:10,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 239. [2020-10-23 18:00:10,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2020-10-23 18:00:10,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 367 transitions. [2020-10-23 18:00:10,219 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 367 transitions. Word has length 179 [2020-10-23 18:00:10,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:10,220 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 367 transitions. [2020-10-23 18:00:10,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-23 18:00:10,220 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 367 transitions. [2020-10-23 18:00:10,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2020-10-23 18:00:10,227 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:10,227 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:10,440 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:10,441 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:10,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1616639890, now seen corresponding path program 6 times [2020-10-23 18:00:10,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:10,443 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295218204] [2020-10-23 18:00:10,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:10,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:10,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,913 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:10,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,930 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:10,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:10,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,962 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:10,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,973 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:10,994 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:11,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-23 18:00:11,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,076 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,082 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,086 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,090 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:11,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,113 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:11,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:11,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-10-23 18:00:11,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295218204] [2020-10-23 18:00:11,284 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73663725] [2020-10-23 18:00:11,284 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:11,411 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-10-23 18:00:11,411 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:11,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-23 18:00:11,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:11,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2020-10-23 18:00:11,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:11,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2020-10-23 18:00:11,552 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834047910] [2020-10-23 18:00:11,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-23 18:00:11,553 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:11,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-23 18:00:11,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2020-10-23 18:00:11,554 INFO L87 Difference]: Start difference. First operand 239 states and 367 transitions. Second operand 13 states. [2020-10-23 18:00:12,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:12,616 INFO L93 Difference]: Finished difference Result 516 states and 854 transitions. [2020-10-23 18:00:12,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-23 18:00:12,617 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 288 [2020-10-23 18:00:12,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:12,627 INFO L225 Difference]: With dead ends: 516 [2020-10-23 18:00:12,628 INFO L226 Difference]: Without dead ends: 511 [2020-10-23 18:00:12,630 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 370 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=492, Unknown=0, NotChecked=0, Total=702 [2020-10-23 18:00:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2020-10-23 18:00:12,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 496. [2020-10-23 18:00:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 496 states. [2020-10-23 18:00:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 827 transitions. [2020-10-23 18:00:12,724 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 827 transitions. Word has length 288 [2020-10-23 18:00:12,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:12,727 INFO L481 AbstractCegarLoop]: Abstraction has 496 states and 827 transitions. [2020-10-23 18:00:12,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-23 18:00:12,727 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 827 transitions. [2020-10-23 18:00:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2020-10-23 18:00:12,744 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:12,745 INFO L422 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:12,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:12,960 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:12,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:12,961 INFO L82 PathProgramCache]: Analyzing trace with hash -222185435, now seen corresponding path program 7 times [2020-10-23 18:00:12,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:12,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349915204] [2020-10-23 18:00:12,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:13,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:13,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:13,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:13,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,792 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,804 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,810 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,820 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,829 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,843 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-23 18:00:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,887 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,901 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:13,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,916 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:13,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,921 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:13,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:13,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-23 18:00:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,039 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,043 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:14,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,050 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,052 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,059 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,063 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,067 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,071 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,073 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:14,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:14,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,099 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,102 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,106 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2020-10-23 18:00:14,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349915204] [2020-10-23 18:00:14,481 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071845370] [2020-10-23 18:00:14,481 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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-10-23 18:00:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:14,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-23 18:00:14,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:14,912 INFO L134 CoverageAnalysis]: Checked inductivity of 12387 backedges. 361 proven. 2270 refuted. 0 times theorem prover too weak. 9756 trivial. 0 not checked. [2020-10-23 18:00:14,912 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:14,912 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 14 [2020-10-23 18:00:14,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973216604] [2020-10-23 18:00:14,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-23 18:00:14,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:14,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-23 18:00:14,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-10-23 18:00:14,916 INFO L87 Difference]: Start difference. First operand 496 states and 827 transitions. Second operand 14 states. [2020-10-23 18:00:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:16,179 INFO L93 Difference]: Finished difference Result 1040 states and 1857 transitions. [2020-10-23 18:00:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-10-23 18:00:16,180 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 465 [2020-10-23 18:00:16,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:16,207 INFO L225 Difference]: With dead ends: 1040 [2020-10-23 18:00:16,207 INFO L226 Difference]: Without dead ends: 1035 [2020-10-23 18:00:16,211 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=262, Invalid=608, Unknown=0, NotChecked=0, Total=870 [2020-10-23 18:00:16,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2020-10-23 18:00:16,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1017. [2020-10-23 18:00:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1017 states. [2020-10-23 18:00:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1826 transitions. [2020-10-23 18:00:16,361 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1826 transitions. Word has length 465 [2020-10-23 18:00:16,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:16,364 INFO L481 AbstractCegarLoop]: Abstraction has 1017 states and 1826 transitions. [2020-10-23 18:00:16,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-23 18:00:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1826 transitions. [2020-10-23 18:00:16,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2020-10-23 18:00:16,394 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:16,395 INFO L422 BasicCegarLoop]: trace histogram [109, 109, 88, 54, 54, 54, 54, 54, 54, 54, 34, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:16,607 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-10-23 18:00:16,608 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:16,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:16,609 INFO L82 PathProgramCache]: Analyzing trace with hash 79201516, now seen corresponding path program 8 times [2020-10-23 18:00:16,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:16,609 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343430143] [2020-10-23 18:00:16,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:16,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-23 18:00:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-23 18:00:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,599 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:17,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,101 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,109 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,170 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,173 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,186 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-23 18:00:18,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,247 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,250 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,253 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,257 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,263 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,266 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,270 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:18,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,277 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-10-23 18:00:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,379 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,387 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,391 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,405 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,411 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,428 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,439 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,440 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,443 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-10-23 18:00:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,822 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,830 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:18,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,849 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-23 18:00:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,889 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,892 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-23 18:00:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,935 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,952 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-23 18:00:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,958 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-23 18:00:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,968 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-23 18:00:18,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,974 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-23 18:00:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:18,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-23 18:00:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-23 18:00:19,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-10-23 18:00:19,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343430143] [2020-10-23 18:00:19,774 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [742503384] [2020-10-23 18:00:19,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-10-23 18:00:20,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-23 18:00:20,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-23 18:00:20,069 INFO L263 TraceCheckSpWp]: Trace formula consists of 1731 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-23 18:00:20,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-23 18:00:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 33096 backedges. 659 proven. 4380 refuted. 0 times theorem prover too weak. 28057 trivial. 0 not checked. [2020-10-23 18:00:20,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-23 18:00:20,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 15 [2020-10-23 18:00:20,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837518278] [2020-10-23 18:00:20,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-23 18:00:20,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-23 18:00:20,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-23 18:00:20,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2020-10-23 18:00:20,513 INFO L87 Difference]: Start difference. First operand 1017 states and 1826 transitions. Second operand 15 states. [2020-10-23 18:00:22,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-23 18:00:22,025 INFO L93 Difference]: Finished difference Result 2092 states and 4006 transitions. [2020-10-23 18:00:22,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2020-10-23 18:00:22,026 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 751 [2020-10-23 18:00:22,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-23 18:00:22,083 INFO L225 Difference]: With dead ends: 2092 [2020-10-23 18:00:22,084 INFO L226 Difference]: Without dead ends: 2087 [2020-10-23 18:00:22,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1000 GetRequests, 969 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=736, Unknown=0, NotChecked=0, Total=1056 [2020-10-23 18:00:22,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2020-10-23 18:00:22,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2066. [2020-10-23 18:00:22,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2066 states. [2020-10-23 18:00:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 3971 transitions. [2020-10-23 18:00:22,338 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 3971 transitions. Word has length 751 [2020-10-23 18:00:22,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-23 18:00:22,339 INFO L481 AbstractCegarLoop]: Abstraction has 2066 states and 3971 transitions. [2020-10-23 18:00:22,339 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-23 18:00:22,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 3971 transitions. [2020-10-23 18:00:22,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1215 [2020-10-23 18:00:22,410 INFO L414 BasicCegarLoop]: Found error trace [2020-10-23 18:00:22,410 INFO L422 BasicCegarLoop]: trace histogram [177, 177, 143, 88, 88, 88, 88, 88, 88, 88, 55, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-23 18:00:22,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-23 18:00:22,624 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-23 18:00:22,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-23 18:00:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1188372578, now seen corresponding path program 9 times [2020-10-23 18:00:22,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-23 18:00:22,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275345043] [2020-10-23 18:00:22,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-23 18:00:23,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:00:23,038 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:00:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-23 18:00:23,398 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-23 18:00:24,196 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-23 18:00:24,197 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-23 18:00:24,197 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-23 18:00:24,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.10 06:00:24 BoogieIcfgContainer [2020-10-23 18:00:24,480 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-23 18:00:24,483 INFO L168 Benchmark]: Toolchain (without parser) took 25442.24 ms. Allocated memory was 152.0 MB in the beginning and 858.8 MB in the end (delta: 706.7 MB). Free memory was 127.7 MB in the beginning and 544.8 MB in the end (delta: -417.1 MB). Peak memory consumption was 290.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:00:24,484 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 125.8 MB. Free memory is still 86.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-23 18:00:24,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.23 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 118.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-23 18:00:24,488 INFO L168 Benchmark]: Boogie Preprocessor took 34.25 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-23 18:00:24,497 INFO L168 Benchmark]: RCFGBuilder took 478.63 ms. Allocated memory is still 152.0 MB. Free memory was 116.7 MB in the beginning and 103.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2020-10-23 18:00:24,497 INFO L168 Benchmark]: TraceAbstraction took 24594.16 ms. Allocated memory was 152.0 MB in the beginning and 858.8 MB in the end (delta: 706.7 MB). Free memory was 103.3 MB in the beginning and 544.8 MB in the end (delta: -441.4 MB). Peak memory consumption was 266.3 MB. Max. memory is 8.0 GB. [2020-10-23 18:00:24,502 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.18 ms. Allocated memory is still 125.8 MB. Free memory is still 86.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 320.23 ms. Allocated memory is still 152.0 MB. Free memory was 127.0 MB in the beginning and 118.1 MB in the end (delta: 8.9 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.25 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.7 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 478.63 ms. Allocated memory is still 152.0 MB. Free memory was 116.7 MB in the beginning and 103.9 MB in the end (delta: 12.8 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 24594.16 ms. Allocated memory was 152.0 MB in the beginning and 858.8 MB in the end (delta: 706.7 MB). Free memory was 103.3 MB in the beginning and 544.8 MB in the end (delta: -441.4 MB). Peak memory consumption was 266.3 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 10; VAL [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) VAL [fibo(x)=55, x=10] [L27] int result = fibo(x); [L28] COND TRUE result == 55 VAL [result=55, x=10] [L29] CALL reach_error() [L4] __assert_fail("0", "fibo_10-1.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 24.2s, OverallIterations: 12, TraceHistogramMax: 177, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 231 SDtfs, 778 SDslu, 319 SDs, 0 SdLazy, 1690 SolverSat, 958 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2782 GetRequests, 2565 SyntacticMatches, 1 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2066occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 11 MinimizatonAttempts, 80 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 5227 NumberOfCodeBlocks, 5035 NumberOfCodeBlocksAsserted, 64 NumberOfCheckSat, 3993 ConstructedInterpolants, 0 QuantifiedInterpolants, 2327855 SizeOfPredicates, 51 NumberOfNonLiveVariables, 4529 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 88959/105548 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...