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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:05:16,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:05:16,980 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:05:16,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:05:16,992 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:05:16,993 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:05:16,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:05:16,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:05:17,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:05:17,003 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:05:17,004 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:05:17,005 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:05:17,005 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:05:17,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:05:17,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:05:17,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:05:17,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:05:17,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:05:17,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:05:17,014 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:05:17,016 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:05:17,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:05:17,018 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:05:17,019 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:05:17,021 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:05:17,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:05:17,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:05:17,023 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:05:17,023 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:05:17,025 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:05:17,025 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:05:17,026 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:05:17,026 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:05:17,027 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:05:17,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:05:17,028 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:05:17,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:05:17,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:05:17,030 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:05:17,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:05:17,031 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:05:17,032 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:05:17,047 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:05:17,047 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:05:17,048 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:05:17,049 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:05:17,049 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:05:17,050 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:05:17,050 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:05:17,050 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:05:17,050 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:05:17,050 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:05:17,051 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:05:17,052 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:05:17,052 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:05:17,052 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:05:17,052 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:05:17,052 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:05:17,053 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:05:17,053 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:05:17,053 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:05:17,053 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:05:17,054 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:05:17,054 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:05:17,054 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:05:17,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:05:17,054 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:05:17,055 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:05:17,055 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:05:17,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:05:17,056 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:05:17,056 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:05:17,102 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:05:17,122 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:05:17,129 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:05:17,131 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:05:17,131 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:05:17,132 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2019-09-10 03:05:17,191 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515d1333/d0fdf021a70e430a801d65185a8dcc3d/FLAG638bbb944 [2019-09-10 03:05:17,583 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:05:17,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2019-09-10 03:05:17,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515d1333/d0fdf021a70e430a801d65185a8dcc3d/FLAG638bbb944 [2019-09-10 03:05:17,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6515d1333/d0fdf021a70e430a801d65185a8dcc3d [2019-09-10 03:05:17,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:05:17,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:05:17,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:17,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:05:17,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:05:17,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:17" (1/1) ... [2019-09-10 03:05:17,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f504c0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:17, skipping insertion in model container [2019-09-10 03:05:17,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:17" (1/1) ... [2019-09-10 03:05:18,000 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:05:18,016 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:05:18,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:18,209 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:05:18,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:18,240 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:05:18,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18 WrapperNode [2019-09-10 03:05:18,241 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:18,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:05:18,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:05:18,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:05:18,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,337 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... [2019-09-10 03:05:18,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:05:18,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:05:18,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:05:18,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:05:18,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:05:18,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:05:18,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:05:18,394 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-10 03:05:18,394 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-10 03:05:18,395 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:05:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:05:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:05:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-10 03:05:18,395 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-10 03:05:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:05:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:05:18,396 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:05:18,599 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:05:18,599 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:05:18,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:18 BoogieIcfgContainer [2019-09-10 03:05:18,601 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:05:18,602 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:05:18,603 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:05:18,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:05:18,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:05:17" (1/3) ... [2019-09-10 03:05:18,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:18, skipping insertion in model container [2019-09-10 03:05:18,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:18" (2/3) ... [2019-09-10 03:05:18,623 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:18, skipping insertion in model container [2019-09-10 03:05:18,623 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:18" (3/3) ... [2019-09-10 03:05:18,625 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-09-10 03:05:18,650 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:05:18,662 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:05:18,682 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:05:18,707 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:05:18,707 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:05:18,707 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:05:18,707 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:05:18,708 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:05:18,708 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:05:18,708 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:05:18,708 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:05:18,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-10 03:05:18,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:05:18,733 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:18,734 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:18,736 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:18,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:18,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-10 03:05:18,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:18,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:18,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:18,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:18,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:18,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:18,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:18,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:18,911 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:18,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:18,924 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-10 03:05:19,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:19,036 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-10 03:05:19,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:19,038 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:05:19,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:19,051 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:05:19,051 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:05:19,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:05:19,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:05:19,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:05:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:19,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:19,094 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-10 03:05:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:19,094 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:19,094 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 03:05:19,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:19,096 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:19,097 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:19,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-10 03:05:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:19,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:19,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:19,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:19,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:19,161 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:19,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:19,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:19,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:19,164 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-10 03:05:19,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:19,185 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2019-09-10 03:05:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:19,185 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 03:05:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:19,187 INFO L225 Difference]: With dead ends: 34 [2019-09-10 03:05:19,187 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 03:05:19,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:19,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 03:05:19,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 03:05:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:19,197 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-10 03:05:19,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:19,197 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:19,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:19,198 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:19,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 03:05:19,199 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:19,200 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:19,200 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-10 03:05:19,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:19,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:19,310 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:05:19,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:19,310 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:19,311 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 03:05:19,313 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2019-09-10 03:05:19,349 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:19,350 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:19,422 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:19,424 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 8 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:19,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,428 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:19,468 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:19,469 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:19,504 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 03:05:19,504 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:19,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:19,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-10 03:05:19,506 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:19,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:05:19,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:05:19,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:05:19,507 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2019-09-10 03:05:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:19,783 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-10 03:05:19,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:05:19,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-10 03:05:19,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:19,785 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:05:19,786 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:05:19,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:19,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:05:19,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-10 03:05:19,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 03:05:19,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-10 03:05:19,807 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2019-09-10 03:05:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:19,808 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-10 03:05:19,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:05:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-10 03:05:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:05:19,811 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:19,811 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:19,811 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,812 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-10 03:05:19,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:19,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:19,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:19,813 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:19,904 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:05:19,904 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:19,904 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:19,905 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2019-09-10 03:05:19,905 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:19,907 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:19,908 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:19,939 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:19,941 INFO L272 AbstractInterpreter]: Visited 28 different actions 72 times. Merged at 2 different actions 2 times. Widened at 2 different actions 2 times. Performed 69 root evaluator evaluations with a maximum evaluation depth of 3. Performed 69 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 5 variables. [2019-09-10 03:05:19,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:19,941 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:19,958 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:19,958 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:20,025 INFO L420 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2019-09-10 03:05:20,026 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:20,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:20,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-10 03:05:20,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:20,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:05:20,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:05:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:20,039 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2019-09-10 03:05:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:20,330 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-10 03:05:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:05:20,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-10 03:05:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:20,332 INFO L225 Difference]: With dead ends: 55 [2019-09-10 03:05:20,332 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 03:05:20,333 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:05:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 03:05:20,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-10 03:05:20,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 03:05:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-10 03:05:20,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2019-09-10 03:05:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:20,341 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-10 03:05:20,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:05:20,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-10 03:05:20,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:05:20,344 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:20,344 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:20,344 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:20,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:20,345 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2019-09-10 03:05:20,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:20,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:20,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:20,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:20,427 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:05:20,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:20,428 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:20,428 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:20,429 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:20,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:20,430 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:05:20,459 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:20,459 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:20,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:20,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:20,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:20,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:20,630 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 03:05:20,630 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:20,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:20,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 03:05:21,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:21,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2019-09-10 03:05:21,087 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:21,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:05:21,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:05:21,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:21,089 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2019-09-10 03:05:21,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:21,404 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2019-09-10 03:05:21,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:05:21,406 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-10 03:05:21,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:21,409 INFO L225 Difference]: With dead ends: 84 [2019-09-10 03:05:21,409 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 03:05:21,413 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:05:21,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 03:05:21,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-10 03:05:21,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 03:05:21,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-09-10 03:05:21,433 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2019-09-10 03:05:21,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:21,434 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-09-10 03:05:21,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:05:21,437 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-09-10 03:05:21,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:05:21,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:21,439 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:21,439 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:21,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:21,440 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2019-09-10 03:05:21,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:21,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:21,441 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:21,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:21,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:05:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:21,549 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:21,549 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-10 03:05:21,550 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:21,555 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:21,555 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:21,638 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:21,638 INFO L272 AbstractInterpreter]: Visited 29 different actions 178 times. Merged at 11 different actions 28 times. Widened at 2 different actions 2 times. Performed 204 root evaluator evaluations with a maximum evaluation depth of 3. Performed 204 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 03:05:21,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:21,639 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:21,676 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:21,676 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:21,778 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-10 03:05:21,778 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:21,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:21,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [8] total 21 [2019-09-10 03:05:21,779 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:21,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:05:21,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:05:21,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:21,780 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 15 states. [2019-09-10 03:05:22,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:22,376 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2019-09-10 03:05:22,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:05:22,377 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2019-09-10 03:05:22,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:22,379 INFO L225 Difference]: With dead ends: 79 [2019-09-10 03:05:22,379 INFO L226 Difference]: Without dead ends: 79 [2019-09-10 03:05:22,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:05:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-09-10 03:05:22,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2019-09-10 03:05:22,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-10 03:05:22,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2019-09-10 03:05:22,390 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 55 [2019-09-10 03:05:22,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:22,391 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2019-09-10 03:05:22,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:05:22,391 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2019-09-10 03:05:22,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 03:05:22,394 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:22,394 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:22,395 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:22,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:22,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1937391112, now seen corresponding path program 1 times [2019-09-10 03:05:22,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:22,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:22,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:22,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:22,397 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:22,490 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 39 proven. 19 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-10 03:05:22,490 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:22,491 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:22,491 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 81 with the following transitions: [2019-09-10 03:05:22,491 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:22,493 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:22,493 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:22,511 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:22,511 INFO L272 AbstractInterpreter]: Visited 27 different actions 94 times. Merged at 9 different actions 20 times. Widened at 2 different actions 2 times. Performed 107 root evaluator evaluations with a maximum evaluation depth of 3. Performed 107 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 3 fixpoints after 3 different actions. Largest state had 5 variables. [2019-09-10 03:05:22,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:22,512 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:22,526 INFO L227 lantSequenceWeakener]: Weakened 13 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:22,526 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:22,592 INFO L420 sIntCurrentIteration]: We unified 79 AI predicates to 79 [2019-09-10 03:05:22,592 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:22,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:22,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [8] total 19 [2019-09-10 03:05:22,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:22,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:22,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:22,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:05:22,594 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand 13 states. [2019-09-10 03:05:23,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:23,063 INFO L93 Difference]: Finished difference Result 86 states and 103 transitions. [2019-09-10 03:05:23,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:05:23,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 80 [2019-09-10 03:05:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:23,065 INFO L225 Difference]: With dead ends: 86 [2019-09-10 03:05:23,066 INFO L226 Difference]: Without dead ends: 86 [2019-09-10 03:05:23,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:23,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-09-10 03:05:23,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2019-09-10 03:05:23,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-09-10 03:05:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 103 transitions. [2019-09-10 03:05:23,076 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 103 transitions. Word has length 80 [2019-09-10 03:05:23,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:23,076 INFO L475 AbstractCegarLoop]: Abstraction has 86 states and 103 transitions. [2019-09-10 03:05:23,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 103 transitions. [2019-09-10 03:05:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:05:23,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:23,079 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:23,080 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:23,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:23,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1541382103, now seen corresponding path program 1 times [2019-09-10 03:05:23,080 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:23,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:23,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:23,081 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:23,193 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 47 proven. 24 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:05:23,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:23,194 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:23,194 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 95 with the following transitions: [2019-09-10 03:05:23,194 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:23,197 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:23,197 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:23,287 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:05:23,288 INFO L272 AbstractInterpreter]: Visited 34 different actions 801 times. Merged at 14 different actions 100 times. Widened at 2 different actions 2 times. Performed 885 root evaluator evaluations with a maximum evaluation depth of 3. Performed 885 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 4 different actions. Largest state had 5 variables. [2019-09-10 03:05:23,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:23,288 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:05:23,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:23,289 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:23,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:23,310 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:23,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:23,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 03:05:23,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 64 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 03:05:23,459 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:24,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:24,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:24,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:24,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:24,412 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 36 proven. 72 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-10 03:05:24,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:24,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 13] total 18 [2019-09-10 03:05:24,418 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:24,419 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:24,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:24,422 INFO L87 Difference]: Start difference. First operand 86 states and 103 transitions. Second operand 13 states. [2019-09-10 03:05:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:24,721 INFO L93 Difference]: Finished difference Result 188 states and 320 transitions. [2019-09-10 03:05:24,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-10 03:05:24,724 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 94 [2019-09-10 03:05:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:24,727 INFO L225 Difference]: With dead ends: 188 [2019-09-10 03:05:24,727 INFO L226 Difference]: Without dead ends: 162 [2019-09-10 03:05:24,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 169 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-09-10 03:05:24,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-10 03:05:24,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 93. [2019-09-10 03:05:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-09-10 03:05:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 119 transitions. [2019-09-10 03:05:24,753 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 119 transitions. Word has length 94 [2019-09-10 03:05:24,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:24,754 INFO L475 AbstractCegarLoop]: Abstraction has 93 states and 119 transitions. [2019-09-10 03:05:24,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:24,754 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 119 transitions. [2019-09-10 03:05:24,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-10 03:05:24,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:24,756 INFO L399 BasicCegarLoop]: trace histogram [12, 12, 9, 9, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:24,757 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:24,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:24,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1353168305, now seen corresponding path program 2 times [2019-09-10 03:05:24,757 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:24,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:24,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:24,758 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:25,060 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 92 proven. 162 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2019-09-10 03:05:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:25,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:25,061 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:25,061 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:25,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:25,061 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:25,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:25,076 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:25,116 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:25,117 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:25,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:05:25,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:25,280 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 189 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-10 03:05:25,280 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:25,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:25,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:25,948 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 189 proven. 21 refuted. 0 times theorem prover too weak. 331 trivial. 0 not checked. [2019-09-10 03:05:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11, 11] total 21 [2019-09-10 03:05:25,952 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:25,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:05:25,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:05:25,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:05:25,955 INFO L87 Difference]: Start difference. First operand 93 states and 119 transitions. Second operand 17 states. [2019-09-10 03:05:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:26,648 INFO L93 Difference]: Finished difference Result 167 states and 243 transitions. [2019-09-10 03:05:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-10 03:05:26,649 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 148 [2019-09-10 03:05:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:26,655 INFO L225 Difference]: With dead ends: 167 [2019-09-10 03:05:26,655 INFO L226 Difference]: Without dead ends: 163 [2019-09-10 03:05:26,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 282 SyntacticMatches, 9 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=1104, Unknown=0, NotChecked=0, Total=1332 [2019-09-10 03:05:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-09-10 03:05:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 140. [2019-09-10 03:05:26,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 03:05:26,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 200 transitions. [2019-09-10 03:05:26,685 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 200 transitions. Word has length 148 [2019-09-10 03:05:26,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:26,686 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 200 transitions. [2019-09-10 03:05:26,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:05:26,686 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 200 transitions. [2019-09-10 03:05:26,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-10 03:05:26,692 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:26,693 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 12, 12, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:26,693 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:26,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1050537191, now seen corresponding path program 3 times [2019-09-10 03:05:26,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:26,695 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:26,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:26,695 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:26,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:26,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 137 proven. 180 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-09-10 03:05:26,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:26,963 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:26,964 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:26,964 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:26,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:26,964 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:26,975 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:26,975 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:05:27,038 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:27,039 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:27,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:05:27,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:27,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 535 proven. 0 refuted. 0 times theorem prover too weak. 909 trivial. 0 not checked. [2019-09-10 03:05:27,145 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:27,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 94 proven. 163 refuted. 0 times theorem prover too weak. 1187 trivial. 0 not checked. [2019-09-10 03:05:27,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:05:27,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [12, 6] total 17 [2019-09-10 03:05:27,591 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:27,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:05:27,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:05:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:05:27,592 INFO L87 Difference]: Start difference. First operand 140 states and 200 transitions. Second operand 6 states. [2019-09-10 03:05:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:27,673 INFO L93 Difference]: Finished difference Result 140 states and 198 transitions. [2019-09-10 03:05:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:05:27,674 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-09-10 03:05:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:27,676 INFO L225 Difference]: With dead ends: 140 [2019-09-10 03:05:27,676 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 03:05:27,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 466 GetRequests, 446 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:27,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 03:05:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-10 03:05:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 03:05:27,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 198 transitions. [2019-09-10 03:05:27,703 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 198 transitions. Word has length 226 [2019-09-10 03:05:27,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:27,704 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 198 transitions. [2019-09-10 03:05:27,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:05:27,704 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 198 transitions. [2019-09-10 03:05:27,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-10 03:05:27,710 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:27,710 INFO L399 BasicCegarLoop]: trace histogram [15, 15, 12, 12, 12, 9, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:27,710 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:27,711 INFO L82 PathProgramCache]: Analyzing trace with hash 687487926, now seen corresponding path program 4 times [2019-09-10 03:05:27,711 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:27,712 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:27,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:27,712 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:27,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:27,857 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 126 proven. 131 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2019-09-10 03:05:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:27,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:27,858 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:27,858 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:27,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:27,858 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:27,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:27,869 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:27,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:27,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 11 conjunts are in the unsatisfiable core [2019-09-10 03:05:27,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:27,986 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 124 proven. 132 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2019-09-10 03:05:27,986 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:28,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:28,815 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 125 proven. 135 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-09-10 03:05:28,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:28,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 18 [2019-09-10 03:05:28,828 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:28,828 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 03:05:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 03:05:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:28,829 INFO L87 Difference]: Start difference. First operand 140 states and 198 transitions. Second operand 13 states. [2019-09-10 03:05:29,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:29,020 INFO L93 Difference]: Finished difference Result 186 states and 293 transitions. [2019-09-10 03:05:29,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:05:29,021 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 190 [2019-09-10 03:05:29,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:29,025 INFO L225 Difference]: With dead ends: 186 [2019-09-10 03:05:29,026 INFO L226 Difference]: Without dead ends: 146 [2019-09-10 03:05:29,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 366 SyntacticMatches, 10 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2019-09-10 03:05:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-09-10 03:05:29,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2019-09-10 03:05:29,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-09-10 03:05:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 195 transitions. [2019-09-10 03:05:29,046 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 195 transitions. Word has length 190 [2019-09-10 03:05:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:29,047 INFO L475 AbstractCegarLoop]: Abstraction has 143 states and 195 transitions. [2019-09-10 03:05:29,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 03:05:29,048 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 195 transitions. [2019-09-10 03:05:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-10 03:05:29,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:29,052 INFO L399 BasicCegarLoop]: trace histogram [17, 17, 13, 12, 12, 9, 8, 8, 8, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:29,053 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1132779741, now seen corresponding path program 5 times [2019-09-10 03:05:29,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:29,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:29,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:29,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:29,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 199 proven. 78 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2019-09-10 03:05:29,254 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:29,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:29,255 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:29,255 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:29,255 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:29,255 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:05:29,278 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:29,279 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:29,304 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-10 03:05:29,304 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:29,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:29,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:29,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 251 proven. 6 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2019-09-10 03:05:29,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:29,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1094 backedges. 251 proven. 6 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2019-09-10 03:05:30,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:30,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 19 [2019-09-10 03:05:30,014 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:30,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-10 03:05:30,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-10 03:05:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-09-10 03:05:30,016 INFO L87 Difference]: Start difference. First operand 143 states and 195 transitions. Second operand 16 states. [2019-09-10 03:05:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:30,382 INFO L93 Difference]: Finished difference Result 186 states and 270 transitions. [2019-09-10 03:05:30,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-10 03:05:30,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 203 [2019-09-10 03:05:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:30,385 INFO L225 Difference]: With dead ends: 186 [2019-09-10 03:05:30,385 INFO L226 Difference]: Without dead ends: 183 [2019-09-10 03:05:30,386 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 394 SyntacticMatches, 7 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=614, Unknown=0, NotChecked=0, Total=756 [2019-09-10 03:05:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-09-10 03:05:30,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 156. [2019-09-10 03:05:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-09-10 03:05:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 217 transitions. [2019-09-10 03:05:30,397 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 217 transitions. Word has length 203 [2019-09-10 03:05:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:30,397 INFO L475 AbstractCegarLoop]: Abstraction has 156 states and 217 transitions. [2019-09-10 03:05:30,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-10 03:05:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 217 transitions. [2019-09-10 03:05:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 03:05:30,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:30,401 INFO L399 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:30,401 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:30,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:30,401 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 6 times [2019-09-10 03:05:30,402 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:30,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:30,403 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:30,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:30,403 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:05:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:05:30,469 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:05:30,517 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:05:30 BoogieIcfgContainer [2019-09-10 03:05:30,517 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:05:30,520 INFO L168 Benchmark]: Toolchain (without parser) took 12536.49 ms. Allocated memory was 133.2 MB in the beginning and 447.7 MB in the end (delta: 314.6 MB). Free memory was 89.4 MB in the beginning and 248.0 MB in the end (delta: -158.6 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,520 INFO L168 Benchmark]: CDTParser took 1.14 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 257.58 ms. Allocated memory is still 133.2 MB. Free memory was 89.0 MB in the beginning and 79.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,522 INFO L168 Benchmark]: Boogie Preprocessor took 103.69 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 79.8 MB in the beginning and 176.3 MB in the end (delta: -96.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,523 INFO L168 Benchmark]: RCFGBuilder took 255.37 ms. Allocated memory is still 199.2 MB. Free memory was 175.7 MB in the beginning and 163.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,524 INFO L168 Benchmark]: TraceAbstraction took 11914.46 ms. Allocated memory was 199.2 MB in the beginning and 447.7 MB in the end (delta: 248.5 MB). Free memory was 163.1 MB in the beginning and 248.0 MB in the end (delta: -84.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:30,528 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14 ms. Allocated memory is still 133.2 MB. Free memory was 107.6 MB in the beginning and 107.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 257.58 ms. Allocated memory is still 133.2 MB. Free memory was 89.0 MB in the beginning and 79.8 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 103.69 ms. Allocated memory was 133.2 MB in the beginning and 199.2 MB in the end (delta: 66.1 MB). Free memory was 79.8 MB in the beginning and 176.3 MB in the end (delta: -96.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 255.37 ms. Allocated memory is still 199.2 MB. Free memory was 175.7 MB in the beginning and 163.1 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11914.46 ms. Allocated memory was 199.2 MB in the beginning and 447.7 MB in the end (delta: 248.5 MB). Free memory was 163.1 MB in the beginning and 248.0 MB in the end (delta: -84.9 MB). Peak memory consumption was 163.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; VAL [x=6] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=8, x=6] [L37] int result = fibo1(x); [L38] COND TRUE result == 8 VAL [result=8, x=6] [L39] __VERIFIER_error() VAL [result=8, x=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 11.8s OverallTime, 13 OverallIterations, 21 TraceHistogramMax, 3.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 426 SDtfs, 383 SDslu, 2667 SDs, 0 SdLazy, 1609 SolverSat, 287 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2159 GetRequests, 1913 SyntacticMatches, 48 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 845 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.8613945578231293 AbsIntWeakeningRatio, 0.5714285714285714 AbsIntAvgWeakeningVarsNumRemoved, 0.1836734693877551 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 145 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 2230 NumberOfCodeBlocks, 1961 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2942 ConstructedInterpolants, 0 QuantifiedInterpolants, 681043 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1416 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 11636/12901 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...