/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.1.25-3af5e1f [2020-09-04 13:06:00,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 13:06:00,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 13:06:00,905 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 13:06:00,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 13:06:00,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 13:06:00,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 13:06:00,921 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 13:06:00,924 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 13:06:00,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 13:06:00,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 13:06:00,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 13:06:00,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 13:06:00,932 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 13:06:00,935 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 13:06:00,936 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 13:06:00,938 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 13:06:00,939 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 13:06:00,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 13:06:00,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 13:06:00,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 13:06:00,953 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 13:06:00,954 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 13:06:00,955 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 13:06:00,972 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 13:06:00,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 13:06:00,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 13:06:00,973 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 13:06:00,974 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 13:06:00,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 13:06:00,977 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 13:06:00,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 13:06:00,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 13:06:00,983 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 13:06:00,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 13:06:00,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 13:06:00,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 13:06:00,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 13:06:00,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 13:06:00,988 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 13:06:00,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 13:06:00,990 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-09-04 13:06:01,015 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 13:06:01,016 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 13:06:01,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-09-04 13:06:01,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-09-04 13:06:01,018 INFO L138 SettingsManager]: * Use SBE=true [2020-09-04 13:06:01,018 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 13:06:01,018 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 13:06:01,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 13:06:01,018 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 13:06:01,019 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 13:06:01,019 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 13:06:01,019 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 13:06:01,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 13:06:01,019 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 13:06:01,020 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 13:06:01,020 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 13:06:01,020 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 13:06:01,020 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 13:06:01,021 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-09-04 13:06:01,021 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 13:06:01,021 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 13:06:01,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 13:06:01,021 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 13:06:01,022 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-09-04 13:06:01,023 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-09-04 13:06:01,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 13:06:01,503 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 13:06:01,507 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 13:06:01,508 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 13:06:01,509 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 13:06:01,510 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-04 13:06:01,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0be6a23e/fe33dc792e3f4f038bf00b2b1041d567/FLAGd2f973c81 [2020-09-04 13:06:02,159 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 13:06:02,160 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/recursive-simple/fibo_10-1.c [2020-09-04 13:06:02,169 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0be6a23e/fe33dc792e3f4f038bf00b2b1041d567/FLAGd2f973c81 [2020-09-04 13:06:02,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/a0be6a23e/fe33dc792e3f4f038bf00b2b1041d567 [2020-09-04 13:06:02,524 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 13:06:02,526 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 13:06:02,527 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 13:06:02,527 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 13:06:02,532 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 13:06:02,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,538 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@321fecde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02, skipping insertion in model container [2020-09-04 13:06:02,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,549 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 13:06:02,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 13:06:02,778 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:06:02,784 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 13:06:02,803 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 13:06:02,820 INFO L208 MainTranslator]: Completed translation [2020-09-04 13:06:02,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02 WrapperNode [2020-09-04 13:06:02,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 13:06:02,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 13:06:02,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 13:06:02,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 13:06:02,837 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,837 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,843 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,844 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,848 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,851 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,852 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... [2020-09-04 13:06:02,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 13:06:02,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 13:06:02,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 13:06:02,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 13:06:02,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:03,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 13:06:03,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 13:06:03,026 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-09-04 13:06:03,026 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 13:06:03,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 13:06:03,027 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 13:06:03,027 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-09-04 13:06:03,027 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 13:06:03,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 13:06:03,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 13:06:03,237 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 13:06:03,237 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 13:06:03,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:06:03 BoogieIcfgContainer [2020-09-04 13:06:03,243 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 13:06:03,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 13:06:03,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 13:06:03,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 13:06:03,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 01:06:02" (1/3) ... [2020-09-04 13:06:03,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc2d9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:06:03, skipping insertion in model container [2020-09-04 13:06:03,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 01:06:02" (2/3) ... [2020-09-04 13:06:03,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc2d9cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 01:06:03, skipping insertion in model container [2020-09-04 13:06:03,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 01:06:03" (3/3) ... [2020-09-04 13:06:03,279 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_10-1.c [2020-09-04 13:06:03,306 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-09-04 13:06:03,329 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 13:06:03,358 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 13:06:03,385 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 13:06:03,386 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 13:06:03,386 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-09-04 13:06:03,386 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 13:06:03,386 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 13:06:03,386 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 13:06:03,387 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 13:06:03,387 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 13:06:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2020-09-04 13:06:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-09-04 13:06:03,413 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:03,414 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:03,414 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:03,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:03,422 INFO L82 PathProgramCache]: Analyzing trace with hash 537028541, now seen corresponding path program 1 times [2020-09-04 13:06:03,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:03,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267340557] [2020-09-04 13:06:03,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:06:03,655 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267340557] [2020-09-04 13:06:03,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:06:03,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:06:03,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214671569] [2020-09-04 13:06:03,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:06:03,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:03,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:06:03,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:06:03,679 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2020-09-04 13:06:03,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:03,800 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2020-09-04 13:06:03,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:06:03,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-09-04 13:06:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:03,814 INFO L225 Difference]: With dead ends: 35 [2020-09-04 13:06:03,814 INFO L226 Difference]: Without dead ends: 21 [2020-09-04 13:06:03,819 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:06:03,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-09-04 13:06:03,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-09-04 13:06:03,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:06:03,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:06:03,870 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2020-09-04 13:06:03,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:03,870 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:06:03,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:06:03,871 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:06:03,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-09-04 13:06:03,873 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:03,873 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:03,873 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 13:06:03,873 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:03,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:03,874 INFO L82 PathProgramCache]: Analyzing trace with hash 179123823, now seen corresponding path program 1 times [2020-09-04 13:06:03,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:03,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860098404] [2020-09-04 13:06:03,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,909 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:03,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-09-04 13:06:03,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860098404] [2020-09-04 13:06:03,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 13:06:03,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-09-04 13:06:03,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584909926] [2020-09-04 13:06:03,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-09-04 13:06:03,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:03,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-09-04 13:06:03,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-09-04 13:06:03,964 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2020-09-04 13:06:04,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:04,032 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-09-04 13:06:04,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-09-04 13:06:04,033 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-09-04 13:06:04,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:04,035 INFO L225 Difference]: With dead ends: 27 [2020-09-04 13:06:04,035 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:06:04,036 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-09-04 13:06:04,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:06:04,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-09-04 13:06:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-09-04 13:06:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2020-09-04 13:06:04,044 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2020-09-04 13:06:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:04,045 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-09-04 13:06:04,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-09-04 13:06:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2020-09-04 13:06:04,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-09-04 13:06:04,047 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:04,047 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] [2020-09-04 13:06:04,048 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 13:06:04,048 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:04,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:04,048 INFO L82 PathProgramCache]: Analyzing trace with hash 806022394, now seen corresponding path program 1 times [2020-09-04 13:06:04,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:04,049 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555051151] [2020-09-04 13:06:04,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:04,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,095 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:04,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-09-04 13:06:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:06:04,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555051151] [2020-09-04 13:06:04,188 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798179013] [2020-09-04 13:06:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:06:04,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 13:06:04,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2020-09-04 13:06:04,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346784640] [2020-09-04 13:06:04,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-09-04 13:06:04,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-09-04 13:06:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:06:04,370 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states. [2020-09-04 13:06:04,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:04,501 INFO L93 Difference]: Finished difference Result 38 states and 49 transitions. [2020-09-04 13:06:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-09-04 13:06:04,502 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2020-09-04 13:06:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:04,503 INFO L225 Difference]: With dead ends: 38 [2020-09-04 13:06:04,503 INFO L226 Difference]: Without dead ends: 23 [2020-09-04 13:06:04,504 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-09-04 13:06:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-09-04 13:06:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-09-04 13:06:04,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-09-04 13:06:04,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2020-09-04 13:06:04,512 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2020-09-04 13:06:04,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:04,513 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2020-09-04 13:06:04,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-09-04 13:06:04,513 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2020-09-04 13:06:04,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-09-04 13:06:04,515 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:04,515 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] [2020-09-04 13:06:04,726 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-09-04 13:06:04,727 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:04,728 INFO L82 PathProgramCache]: Analyzing trace with hash -983862936, now seen corresponding path program 1 times [2020-09-04 13:06:04,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:04,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668192089] [2020-09-04 13:06:04,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:04,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,856 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:06:04,865 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668192089] [2020-09-04 13:06:04,866 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893164258] [2020-09-04 13:06:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:04,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:04,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-09-04 13:06:04,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-09-04 13:06:04,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:04,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-09-04 13:06:04,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495461437] [2020-09-04 13:06:04,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-09-04 13:06:04,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:04,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-09-04 13:06:04,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-09-04 13:06:04,945 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 7 states. [2020-09-04 13:06:05,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:05,052 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2020-09-04 13:06:05,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-09-04 13:06:05,053 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2020-09-04 13:06:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:05,055 INFO L225 Difference]: With dead ends: 41 [2020-09-04 13:06:05,055 INFO L226 Difference]: Without dead ends: 37 [2020-09-04 13:06:05,056 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-09-04 13:06:05,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-09-04 13:06:05,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2020-09-04 13:06:05,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-09-04 13:06:05,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 51 transitions. [2020-09-04 13:06:05,067 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 51 transitions. Word has length 27 [2020-09-04 13:06:05,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:05,067 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 51 transitions. [2020-09-04 13:06:05,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-09-04 13:06:05,068 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 51 transitions. [2020-09-04 13:06:05,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 13:06:05,070 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:05,070 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] [2020-09-04 13:06:05,285 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:05,285 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:05,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:05,286 INFO L82 PathProgramCache]: Analyzing trace with hash 146085807, now seen corresponding path program 2 times [2020-09-04 13:06:05,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:05,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990648186] [2020-09-04 13:06:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:05,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,376 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:05,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,426 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,432 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:05,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-09-04 13:06:05,456 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990648186] [2020-09-04 13:06:05,457 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930776545] [2020-09-04 13:06:05,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:05,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:06:05,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:05,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:06:05,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-09-04 13:06:05,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:05,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2020-09-04 13:06:05,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016042277] [2020-09-04 13:06:05,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:06:05,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:05,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:06:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:06:05,606 INFO L87 Difference]: Start difference. First operand 37 states and 51 transitions. Second operand 12 states. [2020-09-04 13:06:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:05,850 INFO L93 Difference]: Finished difference Result 72 states and 109 transitions. [2020-09-04 13:06:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-09-04 13:06:05,851 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2020-09-04 13:06:05,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:05,853 INFO L225 Difference]: With dead ends: 72 [2020-09-04 13:06:05,853 INFO L226 Difference]: Without dead ends: 41 [2020-09-04 13:06:05,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:06:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-09-04 13:06:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-09-04 13:06:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-09-04 13:06:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-09-04 13:06:05,864 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 40 [2020-09-04 13:06:05,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:05,864 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-09-04 13:06:05,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:06:05,865 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-09-04 13:06:05,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-09-04 13:06:05,867 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:05,867 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:06,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:06,081 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:06,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:06,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2001184551, now seen corresponding path program 3 times [2020-09-04 13:06:06,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:06,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626313787] [2020-09-04 13:06:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,131 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:06,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,184 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,242 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:06,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,271 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:06,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:06,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2020-09-04 13:06:06,306 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626313787] [2020-09-04 13:06:06,307 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348623571] [2020-09-04 13:06:06,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:06,345 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-09-04 13:06:06,345 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:06,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2020-09-04 13:06:06,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:06,405 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 65 proven. 22 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2020-09-04 13:06:06,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:06,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-09-04 13:06:06,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757976994] [2020-09-04 13:06:06,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:06:06,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:06:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:06:06,407 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2020-09-04 13:06:06,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:06,577 INFO L93 Difference]: Finished difference Result 88 states and 127 transitions. [2020-09-04 13:06:06,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:06:06,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2020-09-04 13:06:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:06,581 INFO L225 Difference]: With dead ends: 88 [2020-09-04 13:06:06,581 INFO L226 Difference]: Without dead ends: 53 [2020-09-04 13:06:06,583 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:06:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-09-04 13:06:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-09-04 13:06:06,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-09-04 13:06:06,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2020-09-04 13:06:06,593 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 68 [2020-09-04 13:06:06,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:06,594 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-09-04 13:06:06,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:06:06,594 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2020-09-04 13:06:06,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2020-09-04 13:06:06,596 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:06,597 INFO L422 BasicCegarLoop]: trace histogram [17, 17, 14, 8, 8, 8, 8, 8, 8, 8, 6, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:06,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:06,806 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash -19418837, now seen corresponding path program 4 times [2020-09-04 13:06:06,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:06,807 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128979812] [2020-09-04 13:06:06,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,937 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:06,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,021 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,037 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,058 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:07,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,097 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,100 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:07,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,107 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,147 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 13:06:07,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128979812] [2020-09-04 13:06:07,148 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [78909448] [2020-09-04 13:06:07,148 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:07,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-09-04 13:06:07,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:07,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 12 conjunts are in the unsatisfiable core [2020-09-04 13:06:07,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:07,302 INFO L134 CoverageAnalysis]: Checked inductivity of 747 backedges. 47 proven. 280 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2020-09-04 13:06:07,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:07,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2020-09-04 13:06:07,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962742846] [2020-09-04 13:06:07,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 13:06:07,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:07,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 13:06:07,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-09-04 13:06:07,305 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand 10 states. [2020-09-04 13:06:07,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:07,511 INFO L93 Difference]: Finished difference Result 120 states and 179 transitions. [2020-09-04 13:06:07,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 13:06:07,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2020-09-04 13:06:07,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:07,516 INFO L225 Difference]: With dead ends: 120 [2020-09-04 13:06:07,516 INFO L226 Difference]: Without dead ends: 116 [2020-09-04 13:06:07,517 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-09-04 13:06:07,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-09-04 13:06:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 107. [2020-09-04 13:06:07,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2020-09-04 13:06:07,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 162 transitions. [2020-09-04 13:06:07,540 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 162 transitions. Word has length 123 [2020-09-04 13:06:07,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:07,541 INFO L479 AbstractCegarLoop]: Abstraction has 107 states and 162 transitions. [2020-09-04 13:06:07,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 13:06:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 162 transitions. [2020-09-04 13:06:07,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2020-09-04 13:06:07,545 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:07,546 INFO L422 BasicCegarLoop]: trace histogram [31, 31, 25, 15, 15, 15, 15, 15, 15, 15, 10, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:07,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-09-04 13:06:07,759 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:07,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 706081956, now seen corresponding path program 5 times [2020-09-04 13:06:07,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:07,761 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100601027] [2020-09-04 13:06:07,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,848 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:07,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:07,959 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,014 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,047 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,111 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:08,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:08,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:08,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,254 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:08,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,340 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:08,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 432 proven. 761 refuted. 0 times theorem prover too weak. 1387 trivial. 0 not checked. [2020-09-04 13:06:08,484 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100601027] [2020-09-04 13:06:08,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311677368] [2020-09-04 13:06:08,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:08,582 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2020-09-04 13:06:08,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:08,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 20 conjunts are in the unsatisfiable core [2020-09-04 13:06:08,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:08,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2580 backedges. 630 proven. 571 refuted. 0 times theorem prover too weak. 1379 trivial. 0 not checked. [2020-09-04 13:06:08,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:08,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 19 [2020-09-04 13:06:08,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856722889] [2020-09-04 13:06:08,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-09-04 13:06:08,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:08,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-09-04 13:06:08,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:06:08,770 INFO L87 Difference]: Start difference. First operand 107 states and 162 transitions. Second operand 19 states. [2020-09-04 13:06:09,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:09,774 INFO L93 Difference]: Finished difference Result 196 states and 368 transitions. [2020-09-04 13:06:09,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-09-04 13:06:09,774 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 218 [2020-09-04 13:06:09,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:09,781 INFO L225 Difference]: With dead ends: 196 [2020-09-04 13:06:09,781 INFO L226 Difference]: Without dead ends: 98 [2020-09-04 13:06:09,784 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 316 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=321, Invalid=1161, Unknown=0, NotChecked=0, Total=1482 [2020-09-04 13:06:09,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-09-04 13:06:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 87. [2020-09-04 13:06:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-09-04 13:06:09,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 116 transitions. [2020-09-04 13:06:09,799 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 116 transitions. Word has length 218 [2020-09-04 13:06:09,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:09,800 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 116 transitions. [2020-09-04 13:06:09,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-09-04 13:06:09,800 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 116 transitions. [2020-09-04 13:06:09,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2020-09-04 13:06:09,805 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:09,806 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] [2020-09-04 13:06:10,020 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:10,021 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:10,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:10,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1425621089, now seen corresponding path program 6 times [2020-09-04 13:06:10,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:10,022 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570020969] [2020-09-04 13:06:10,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,474 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:10,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,544 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,557 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,568 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,587 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,611 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,615 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,618 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,620 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:10,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:10,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,628 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,651 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:10,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,714 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:10,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,726 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,740 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,745 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,760 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,766 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 189 proven. 1130 refuted. 0 times theorem prover too weak. 3249 trivial. 0 not checked. [2020-09-04 13:06:10,908 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570020969] [2020-09-04 13:06:10,909 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052472406] [2020-09-04 13:06:10,910 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:11,004 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 20 check-sat command(s) [2020-09-04 13:06:11,004 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:11,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 14 conjunts are in the unsatisfiable core [2020-09-04 13:06:11,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:11,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4568 backedges. 331 proven. 821 refuted. 0 times theorem prover too weak. 3416 trivial. 0 not checked. [2020-09-04 13:06:11,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:11,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2020-09-04 13:06:11,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866576447] [2020-09-04 13:06:11,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-09-04 13:06:11,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:11,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-09-04 13:06:11,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2020-09-04 13:06:11,169 INFO L87 Difference]: Start difference. First operand 87 states and 116 transitions. Second operand 12 states. [2020-09-04 13:06:11,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:11,430 INFO L93 Difference]: Finished difference Result 269 states and 401 transitions. [2020-09-04 13:06:11,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 13:06:11,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 286 [2020-09-04 13:06:11,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:11,436 INFO L225 Difference]: With dead ends: 269 [2020-09-04 13:06:11,436 INFO L226 Difference]: Without dead ends: 265 [2020-09-04 13:06:11,437 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=222, Unknown=0, NotChecked=0, Total=342 [2020-09-04 13:06:11,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2020-09-04 13:06:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 250. [2020-09-04 13:06:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2020-09-04 13:06:11,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 371 transitions. [2020-09-04 13:06:11,479 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 371 transitions. Word has length 286 [2020-09-04 13:06:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:11,480 INFO L479 AbstractCegarLoop]: Abstraction has 250 states and 371 transitions. [2020-09-04 13:06:11,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-09-04 13:06:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 371 transitions. [2020-09-04 13:06:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2020-09-04 13:06:11,492 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:11,492 INFO L422 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:11,705 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:11,706 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:11,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:11,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1339067037, now seen corresponding path program 7 times [2020-09-04 13:06:11,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:11,707 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845082892] [2020-09-04 13:06:11,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:11,964 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:11,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,228 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,477 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,531 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,570 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,598 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,655 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,660 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,668 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,678 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,690 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,695 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,751 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,761 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,840 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,870 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,883 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:12,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:06:12,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,048 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,279 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:13,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,285 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,287 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,301 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,305 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,309 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:13,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:13,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,334 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,343 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,347 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:13,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,356 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,375 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:13,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 2940 proven. 2962 refuted. 0 times theorem prover too weak. 10505 trivial. 0 not checked. [2020-09-04 13:06:13,764 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845082892] [2020-09-04 13:06:13,765 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1968341808] [2020-09-04 13:06:13,765 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:13,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 1181 conjuncts, 18 conjunts are in the unsatisfiable core [2020-09-04 13:06:13,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:14,177 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 386 proven. 2689 refuted. 0 times theorem prover too weak. 13332 trivial. 0 not checked. [2020-09-04 13:06:14,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:14,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 21 [2020-09-04 13:06:14,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713443844] [2020-09-04 13:06:14,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-09-04 13:06:14,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:14,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-09-04 13:06:14,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2020-09-04 13:06:14,180 INFO L87 Difference]: Start difference. First operand 250 states and 371 transitions. Second operand 21 states. [2020-09-04 13:06:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:15,331 INFO L93 Difference]: Finished difference Result 390 states and 682 transitions. [2020-09-04 13:06:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-09-04 13:06:15,331 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 531 [2020-09-04 13:06:15,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:15,335 INFO L225 Difference]: With dead ends: 390 [2020-09-04 13:06:15,335 INFO L226 Difference]: Without dead ends: 154 [2020-09-04 13:06:15,338 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 739 GetRequests, 691 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1951, Unknown=0, NotChecked=0, Total=2450 [2020-09-04 13:06:15,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2020-09-04 13:06:15,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 125. [2020-09-04 13:06:15,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2020-09-04 13:06:15,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 181 transitions. [2020-09-04 13:06:15,353 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 181 transitions. Word has length 531 [2020-09-04 13:06:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:15,354 INFO L479 AbstractCegarLoop]: Abstraction has 125 states and 181 transitions. [2020-09-04 13:06:15,354 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-09-04 13:06:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 181 transitions. [2020-09-04 13:06:15,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1036 [2020-09-04 13:06:15,396 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:15,397 INFO L422 BasicCegarLoop]: trace histogram [151, 151, 122, 75, 75, 75, 75, 75, 75, 75, 47, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:15,611 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-09-04 13:06:15,612 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:15,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2047979866, now seen corresponding path program 8 times [2020-09-04 13:06:15,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:15,614 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290780845] [2020-09-04 13:06:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:15,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:16,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:16,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,201 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,404 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,510 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,623 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,654 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,677 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,723 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,728 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:17,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:17,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,739 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,741 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,747 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,759 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,765 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,767 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:17,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:17,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,813 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,818 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:17,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,825 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,880 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:17,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:17,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,919 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,922 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,932 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:17,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,941 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,944 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:17,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:17,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:06:18,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,051 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,066 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,081 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,108 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,112 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:18,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,123 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:18,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,128 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,135 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:18,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:18,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,193 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:18,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,374 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-09-04 13:06:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,928 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:18,995 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,075 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,104 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,163 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,192 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,198 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,200 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,209 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,229 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,233 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,236 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,237 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,240 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:19,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,304 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,313 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,319 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,324 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,327 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,330 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,339 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,344 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,352 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,425 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:06:19,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,503 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,509 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,517 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,528 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,552 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,582 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,584 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 391 [2020-09-04 13:06:19,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,814 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,851 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,867 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,904 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,910 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,914 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:19,917 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:19,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 6633 proven. 9072 refuted. 0 times theorem prover too weak. 48076 trivial. 0 not checked. [2020-09-04 13:06:21,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290780845] [2020-09-04 13:06:21,035 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35618327] [2020-09-04 13:06:21,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate-2/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-09-04 13:06:21,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-09-04 13:06:21,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:21,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 2300 conjuncts, 20 conjunts are in the unsatisfiable core [2020-09-04 13:06:21,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:21,859 INFO L134 CoverageAnalysis]: Checked inductivity of 63781 backedges. 764 proven. 6387 refuted. 0 times theorem prover too weak. 56630 trivial. 0 not checked. [2020-09-04 13:06:21,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:21,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13] total 24 [2020-09-04 13:06:21,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79688031] [2020-09-04 13:06:21,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-09-04 13:06:21,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:21,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-09-04 13:06:21,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2020-09-04 13:06:21,864 INFO L87 Difference]: Start difference. First operand 125 states and 181 transitions. Second operand 24 states. [2020-09-04 13:06:23,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:23,402 INFO L93 Difference]: Finished difference Result 279 states and 510 transitions. [2020-09-04 13:06:23,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2020-09-04 13:06:23,402 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1035 [2020-09-04 13:06:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:23,406 INFO L225 Difference]: With dead ends: 279 [2020-09-04 13:06:23,407 INFO L226 Difference]: Without dead ends: 172 [2020-09-04 13:06:23,409 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1400 GetRequests, 1344 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=639, Invalid=2667, Unknown=0, NotChecked=0, Total=3306 [2020-09-04 13:06:23,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-09-04 13:06:23,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 150. [2020-09-04 13:06:23,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2020-09-04 13:06:23,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 230 transitions. [2020-09-04 13:06:23,424 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 230 transitions. Word has length 1035 [2020-09-04 13:06:23,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:23,425 INFO L479 AbstractCegarLoop]: Abstraction has 150 states and 230 transitions. [2020-09-04 13:06:23,425 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-09-04 13:06:23,425 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 230 transitions. [2020-09-04 13:06:23,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1676 [2020-09-04 13:06:23,447 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:23,448 INFO L422 BasicCegarLoop]: trace histogram [245, 245, 198, 122, 122, 122, 122, 122, 122, 122, 76, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 13:06:23,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:23,649 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:23,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:23,650 INFO L82 PathProgramCache]: Analyzing trace with hash 667367253, now seen corresponding path program 9 times [2020-09-04 13:06:23,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:23,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374405631] [2020-09-04 13:06:23,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:25,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 13:06:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:25,688 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2020-09-04 13:06:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:26,908 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,300 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,641 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,679 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,730 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,780 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,790 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,796 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,798 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,805 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,819 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,827 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:27,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,865 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,874 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,878 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:27,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,882 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,918 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,950 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:27,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,981 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,983 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,987 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:27,998 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:27,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:06:28,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,141 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:28,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,162 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:28,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,175 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,180 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,202 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,206 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,350 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-09-04 13:06:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,422 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,465 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,478 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,486 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:28,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,536 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,539 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,542 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,548 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,555 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,569 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,573 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,575 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,578 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,595 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:28,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,616 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,621 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,624 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,627 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,630 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,638 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,646 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:28,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,649 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:28,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 745 [2020-09-04 13:06:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,401 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,645 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,815 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,838 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,852 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,859 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,864 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,868 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,871 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,873 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,879 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,897 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,899 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,906 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,915 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,920 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,923 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:29,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,929 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,936 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,957 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:29,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,972 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,985 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,989 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,991 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:29,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:29,996 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,002 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,008 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,019 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,023 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,069 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2020-09-04 13:06:30,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,092 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,103 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,115 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,120 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,125 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:30,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,138 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,140 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,147 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,154 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,160 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,174 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 459 [2020-09-04 13:06:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,302 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,349 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,416 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,484 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,490 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,495 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,497 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,508 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,512 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,514 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,516 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,523 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,535 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,540 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,545 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,546 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,549 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 636 [2020-09-04 13:06:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,808 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,821 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,828 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,833 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,835 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,837 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,839 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,841 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,845 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,850 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,855 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,858 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,860 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,862 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,869 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-09-04 13:06:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,881 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,884 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,888 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,893 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,895 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,911 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-09-04 13:06:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,925 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,938 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,943 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,945 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,946 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-09-04 13:06:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,951 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,954 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-09-04 13:06:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,963 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-09-04 13:06:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,965 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 13:06:30,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:30,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-09-04 13:06:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 13:06:33,165 INFO L134 CoverageAnalysis]: Checked inductivity of 168587 backedges. 8170 proven. 13512 refuted. 0 times theorem prover too weak. 146905 trivial. 0 not checked. [2020-09-04 13:06:33,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374405631] [2020-09-04 13:06:33,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [97569503] [2020-09-04 13:06:33,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:33,927 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 136 check-sat command(s) [2020-09-04 13:06:33,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-09-04 13:06:33,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 2348 conjuncts, 20 conjunts are in the unsatisfiable core [2020-09-04 13:06:33,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-09-04 13:06:35,849 INFO L134 CoverageAnalysis]: Checked inductivity of 168587 backedges. 56858 proven. 1014 refuted. 0 times theorem prover too weak. 110715 trivial. 0 not checked. [2020-09-04 13:06:35,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-09-04 13:06:35,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 27 [2020-09-04 13:06:35,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184654975] [2020-09-04 13:06:35,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-09-04 13:06:35,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-09-04 13:06:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-09-04 13:06:35,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2020-09-04 13:06:35,854 INFO L87 Difference]: Start difference. First operand 150 states and 230 transitions. Second operand 27 states. [2020-09-04 13:06:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 13:06:37,708 INFO L93 Difference]: Finished difference Result 339 states and 608 transitions. [2020-09-04 13:06:37,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2020-09-04 13:06:37,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1675 [2020-09-04 13:06:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 13:06:37,717 INFO L225 Difference]: With dead ends: 339 [2020-09-04 13:06:37,718 INFO L226 Difference]: Without dead ends: 215 [2020-09-04 13:06:37,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2232 GetRequests, 2163 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=919, Invalid=4051, Unknown=0, NotChecked=0, Total=4970 [2020-09-04 13:06:37,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2020-09-04 13:06:37,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 180. [2020-09-04 13:06:37,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2020-09-04 13:06:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 271 transitions. [2020-09-04 13:06:37,752 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 271 transitions. Word has length 1675 [2020-09-04 13:06:37,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 13:06:37,757 INFO L479 AbstractCegarLoop]: Abstraction has 180 states and 271 transitions. [2020-09-04 13:06:37,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-09-04 13:06:37,757 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 271 transitions. [2020-09-04 13:06:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2020-09-04 13:06:37,773 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 13:06:37,773 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] [2020-09-04 13:06:37,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-09-04 13:06:37,988 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 13:06:37,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 13:06:37,989 INFO L82 PathProgramCache]: Analyzing trace with hash 452920407, now seen corresponding path program 10 times [2020-09-04 13:06:37,989 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-09-04 13:06:37,990 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119860273] [2020-09-04 13:06:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 13:06:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:06:38,401 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:06:38,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-09-04 13:06:38,753 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-09-04 13:06:38,825 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-09-04 13:06:38,825 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-09-04 13:06:38,826 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-09-04 13:06:38,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.09 01:06:38 BoogieIcfgContainer [2020-09-04 13:06:38,997 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-09-04 13:06:39,000 INFO L168 Benchmark]: Toolchain (without parser) took 36473.29 ms. Allocated memory was 146.8 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 101.9 MB in the beginning and 335.2 MB in the end (delta: -233.3 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2020-09-04 13:06:39,001 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-09-04 13:06:39,001 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.00 ms. Allocated memory is still 146.8 MB. Free memory was 101.7 MB in the beginning and 92.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. [2020-09-04 13:06:39,002 INFO L168 Benchmark]: Boogie Preprocessor took 32.48 ms. Allocated memory is still 146.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-09-04 13:06:39,003 INFO L168 Benchmark]: RCFGBuilder took 388.01 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 91.0 MB in the beginning and 170.9 MB in the end (delta: -80.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-09-04 13:06:39,004 INFO L168 Benchmark]: TraceAbstraction took 35738.19 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 170.3 MB in the beginning and 335.2 MB in the end (delta: -164.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2020-09-04 13:06:39,007 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.56 ms. Allocated memory is still 146.8 MB. Free memory was 120.1 MB in the beginning and 119.9 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 295.00 ms. Allocated memory is still 146.8 MB. Free memory was 101.7 MB in the beginning and 92.4 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.48 ms. Allocated memory is still 146.8 MB. Free memory was 92.4 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 388.01 ms. Allocated memory was 146.8 MB in the beginning and 202.9 MB in the end (delta: 56.1 MB). Free memory was 91.0 MB in the beginning and 170.9 MB in the end (delta: -80.0 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 35738.19 ms. Allocated memory was 202.9 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 170.3 MB in the beginning and 335.2 MB in the end (delta: -164.9 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 10; VAL [x=10] [L25] CALL, EXPR fibo(x) VAL [\old(n)=10] [L6] COND FALSE !(n < 1) VAL [\old(n)=10, n=10] [L8] COND FALSE !(n == 1) VAL [\old(n)=10, n=10] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=9] [L6] COND FALSE !(n < 1) VAL [\old(n)=9, n=9] [L8] COND FALSE !(n == 1) VAL [\old(n)=9, n=9] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=9, fibo(n-1)=21, n=9] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=9, fibo(n-1)=21, fibo(n-2)=13, n=9] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=10, fibo(n-1)=34, n=10] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=8] [L6] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L8] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=8, fibo(n-1)=13, n=8] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=8, fibo(n-1)=13, fibo(n-2)=8, n=8] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=10, fibo(n-1)=34, fibo(n-2)=21, n=10] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) VAL [fibo(x)=55, x=10] [L25] int result = fibo(x); [L26] COND TRUE result == 55 VAL [result=55, x=10] [L27] __VERIFIER_error() VAL [result=55, x=10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.4s, OverallIterations: 13, TraceHistogramMax: 245, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 305 SDtfs, 1173 SDslu, 1220 SDs, 0 SdLazy, 3012 SolverSat, 1229 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5519 GetRequests, 5223 SyntacticMatches, 0 SemanticMatches, 296 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3019 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 126 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 20.6s InterpolantComputationTime, 9297 NumberOfCodeBlocks, 8456 NumberOfCodeBlocksAsserted, 206 NumberOfCheckSat, 8063 ConstructedInterpolants, 0 QuantifiedInterpolants, 10072029 SizeOfPredicates, 66 NumberOfNonLiveVariables, 7079 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 474224/513862 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...