java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 06:27:00,219 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 06:27:00,222 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 06:27:00,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 06:27:00,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 06:27:00,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 06:27:00,242 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 06:27:00,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 06:27:00,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 06:27:00,247 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 06:27:00,248 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 06:27:00,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 06:27:00,250 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 06:27:00,251 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 06:27:00,252 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 06:27:00,253 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 06:27:00,254 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 06:27:00,255 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 06:27:00,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 06:27:00,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 06:27:00,261 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 06:27:00,263 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 06:27:00,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 06:27:00,265 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 06:27:00,267 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 06:27:00,268 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 06:27:00,268 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 06:27:00,269 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 06:27:00,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 06:27:00,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 06:27:00,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 06:27:00,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 06:27:00,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 06:27:00,273 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 06:27:00,274 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 06:27:00,274 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 06:27:00,275 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 06:27:00,275 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 06:27:00,275 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 06:27:00,276 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 06:27:00,277 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 06:27:00,278 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 06:27:00,296 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 06:27:00,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 06:27:00,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 06:27:00,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 06:27:00,299 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 06:27:00,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 06:27:00,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 06:27:00,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 06:27:00,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 06:27:00,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 06:27:00,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 06:27:00,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 06:27:00,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 06:27:00,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 06:27:00,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 06:27:00,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 06:27:00,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 06:27:00,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 06:27:00,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 06:27:00,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 06:27:00,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 06:27:00,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 06:27:00,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 06:27:00,304 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 06:27:00,304 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 06:27:00,304 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 06:27:00,304 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 06:27:00,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 06:27:00,305 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 06:27:00,343 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 06:27:00,359 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 06:27:00,363 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 06:27:00,365 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 06:27:00,366 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 06:27:00,367 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-08 06:27:00,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6141cb64/7cce24dc42cf4de4ab3a30ea260401b5/FLAGd221133fb [2019-09-08 06:27:01,046 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 06:27:01,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_6-2.c [2019-09-08 06:27:01,056 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6141cb64/7cce24dc42cf4de4ab3a30ea260401b5/FLAGd221133fb [2019-09-08 06:27:01,389 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e6141cb64/7cce24dc42cf4de4ab3a30ea260401b5 [2019-09-08 06:27:01,404 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 06:27:01,406 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 06:27:01,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 06:27:01,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 06:27:01,412 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 06:27:01,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7df3e8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01, skipping insertion in model container [2019-09-08 06:27:01,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,429 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 06:27:01,455 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 06:27:01,692 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:27:01,699 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 06:27:01,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 06:27:01,735 INFO L192 MainTranslator]: Completed translation [2019-09-08 06:27:01,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01 WrapperNode [2019-09-08 06:27:01,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 06:27:01,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 06:27:01,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 06:27:01,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 06:27:01,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (1/1) ... [2019-09-08 06:27:01,907 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 06:27:01,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 06:27:01,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 06:27:01,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 06:27:01,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (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-08 06:27:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 06:27:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 06:27:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-08 06:27:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-08 06:27:01,986 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 06:27:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 06:27:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 06:27:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-08 06:27:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-08 06:27:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 06:27:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 06:27:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 06:27:02,245 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 06:27:02,245 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 06:27:02,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:27:02 BoogieIcfgContainer [2019-09-08 06:27:02,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 06:27:02,252 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 06:27:02,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 06:27:02,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 06:27:02,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:27:01" (1/3) ... [2019-09-08 06:27:02,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb373aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:27:02, skipping insertion in model container [2019-09-08 06:27:02,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:27:01" (2/3) ... [2019-09-08 06:27:02,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bb373aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:27:02, skipping insertion in model container [2019-09-08 06:27:02,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:27:02" (3/3) ... [2019-09-08 06:27:02,284 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-09-08 06:27:02,315 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 06:27:02,343 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 06:27:02,371 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 06:27:02,423 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 06:27:02,426 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 06:27:02,428 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 06:27:02,428 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 06:27:02,428 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 06:27:02,428 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 06:27:02,428 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 06:27:02,429 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 06:27:02,429 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 06:27:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-08 06:27:02,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-08 06:27:02,458 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:02,459 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:27:02,461 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-08 06:27:02,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:02,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:02,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:02,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:02,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:02,661 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-08 06:27:02,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:27:02,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:27:02,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:27:02,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:27:02,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:27:02,685 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-08 06:27:02,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:02,834 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2019-09-08 06:27:02,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:27:02,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-08 06:27:02,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:02,847 INFO L225 Difference]: With dead ends: 44 [2019-09-08 06:27:02,848 INFO L226 Difference]: Without dead ends: 30 [2019-09-08 06:27:02,851 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-08 06:27:02,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-08 06:27:02,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-08 06:27:02,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:27:02,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 06:27:02,903 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-08 06:27:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:02,903 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 06:27:02,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:27:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 06:27:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 06:27:02,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:02,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:27:02,906 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-08 06:27:02,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:02,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:02,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:02,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:02,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:02,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:02,972 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-08 06:27:02,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 06:27:02,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 06:27:02,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 06:27:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 06:27:02,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 06:27:02,976 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-08 06:27:03,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:03,004 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2019-09-08 06:27:03,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 06:27:03,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 06:27:03,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:03,007 INFO L225 Difference]: With dead ends: 36 [2019-09-08 06:27:03,008 INFO L226 Difference]: Without dead ends: 32 [2019-09-08 06:27:03,010 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-08 06:27:03,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-08 06:27:03,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-08 06:27:03,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 06:27:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 06:27:03,021 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-08 06:27:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:03,022 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 06:27:03,022 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 06:27:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 06:27:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-08 06:27:03,024 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:03,025 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-08 06:27:03,025 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:03,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-08 06:27:03,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:03,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:03,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:03,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:03,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:03,181 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-08 06:27:03,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:03,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:03,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:03,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:03,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:27:03,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:03,427 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:27:03,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:03,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 9 [2019-09-08 06:27:03,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 06:27:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 06:27:03,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 06:27:03,438 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 9 states. [2019-09-08 06:27:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:03,754 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2019-09-08 06:27:03,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 06:27:03,755 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-09-08 06:27:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:03,757 INFO L225 Difference]: With dead ends: 58 [2019-09-08 06:27:03,758 INFO L226 Difference]: Without dead ends: 34 [2019-09-08 06:27:03,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:27:03,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-08 06:27:03,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-09-08 06:27:03,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-08 06:27:03,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2019-09-08 06:27:03,771 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 26 [2019-09-08 06:27:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:03,772 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2019-09-08 06:27:03,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 06:27:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2019-09-08 06:27:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-08 06:27:03,775 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:03,775 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 06:27:03,776 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:03,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:03,777 INFO L82 PathProgramCache]: Analyzing trace with hash 746633022, now seen corresponding path program 1 times [2019-09-08 06:27:03,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:03,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:03,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:03,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:03,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:03,909 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-08 06:27:03,910 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:03,910 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-08 06:27:03,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:03,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 06:27:03,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 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-08 06:27:04,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:04,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-09-08 06:27:04,017 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 06:27:04,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 06:27:04,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 06:27:04,018 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 7 states. [2019-09-08 06:27:04,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:04,187 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2019-09-08 06:27:04,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 06:27:04,188 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-09-08 06:27:04,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:04,191 INFO L225 Difference]: With dead ends: 43 [2019-09-08 06:27:04,191 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 06:27:04,192 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 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-08 06:27:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 06:27:04,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-08 06:27:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-08 06:27:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-09-08 06:27:04,205 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 27 [2019-09-08 06:27:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:04,206 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-09-08 06:27:04,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 06:27:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2019-09-08 06:27:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-08 06:27:04,208 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:04,209 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-08 06:27:04,209 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:04,210 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-08 06:27:04,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:04,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:04,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:04,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:04,348 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-08 06:27:04,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:04,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-08 06:27:04,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:04,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:27:04,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:04,483 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:27:04,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:04,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8] total 10 [2019-09-08 06:27:04,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 06:27:04,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 06:27:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 06:27:04,493 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand 10 states. [2019-09-08 06:27:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:04,842 INFO L93 Difference]: Finished difference Result 70 states and 100 transitions. [2019-09-08 06:27:04,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:27:04,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2019-09-08 06:27:04,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:04,846 INFO L225 Difference]: With dead ends: 70 [2019-09-08 06:27:04,846 INFO L226 Difference]: Without dead ends: 39 [2019-09-08 06:27:04,852 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 06:27:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-08 06:27:04,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-08 06:27:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-08 06:27:04,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 50 transitions. [2019-09-08 06:27:04,875 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 50 transitions. Word has length 39 [2019-09-08 06:27:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:04,876 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 50 transitions. [2019-09-08 06:27:04,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 06:27:04,877 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2019-09-08 06:27:04,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-08 06:27:04,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:04,881 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, 1] [2019-09-08 06:27:04,882 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:04,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:04,884 INFO L82 PathProgramCache]: Analyzing trace with hash -2100495745, now seen corresponding path program 1 times [2019-09-08 06:27:04,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:04,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:04,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:04,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:04,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:05,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 06:27:05,085 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:05,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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-08 06:27:05,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:05,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 06:27:05,133 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:05,264 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 06:27:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:05,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-09-08 06:27:05,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 06:27:05,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 06:27:05,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 06:27:05,276 INFO L87 Difference]: Start difference. First operand 39 states and 50 transitions. Second operand 14 states. [2019-09-08 06:27:05,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:05,947 INFO L93 Difference]: Finished difference Result 102 states and 162 transitions. [2019-09-08 06:27:05,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 06:27:05,948 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-09-08 06:27:05,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:05,951 INFO L225 Difference]: With dead ends: 102 [2019-09-08 06:27:05,951 INFO L226 Difference]: Without dead ends: 69 [2019-09-08 06:27:05,953 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=492, Unknown=0, NotChecked=0, Total=600 [2019-09-08 06:27:05,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-09-08 06:27:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-09-08 06:27:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-08 06:27:05,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 90 transitions. [2019-09-08 06:27:05,972 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 90 transitions. Word has length 40 [2019-09-08 06:27:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:05,972 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 90 transitions. [2019-09-08 06:27:05,973 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 06:27:05,973 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 90 transitions. [2019-09-08 06:27:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-08 06:27:05,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:05,977 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 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-08 06:27:05,978 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:05,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:05,979 INFO L82 PathProgramCache]: Analyzing trace with hash -405677468, now seen corresponding path program 1 times [2019-09-08 06:27:05,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:05,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:05,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:05,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:06,120 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 06:27:06,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:06,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) [2019-09-08 06:27:06,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:06,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:06,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-08 06:27:06,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 06:27:06,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:06,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2019-09-08 06:27:06,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:27:06,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:27:06,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:27:06,250 INFO L87 Difference]: Start difference. First operand 60 states and 90 transitions. Second operand 12 states. [2019-09-08 06:27:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:06,506 INFO L93 Difference]: Finished difference Result 106 states and 197 transitions. [2019-09-08 06:27:06,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:27:06,507 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-09-08 06:27:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:06,510 INFO L225 Difference]: With dead ends: 106 [2019-09-08 06:27:06,510 INFO L226 Difference]: Without dead ends: 102 [2019-09-08 06:27:06,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:27:06,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-09-08 06:27:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 68. [2019-09-08 06:27:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-08 06:27:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 110 transitions. [2019-09-08 06:27:06,535 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 110 transitions. Word has length 54 [2019-09-08 06:27:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:06,536 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 110 transitions. [2019-09-08 06:27:06,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:27:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 110 transitions. [2019-09-08 06:27:06,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-08 06:27:06,541 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:06,541 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:27:06,542 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:06,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:06,542 INFO L82 PathProgramCache]: Analyzing trace with hash -2119203654, now seen corresponding path program 1 times [2019-09-08 06:27:06,542 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:06,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:06,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:06,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:06,718 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2019-09-08 06:27:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:06,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:06,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:06,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:27:06,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 17 proven. 119 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-09-08 06:27:06,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:06,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 11 [2019-09-08 06:27:06,865 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 06:27:06,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 06:27:06,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 06:27:06,866 INFO L87 Difference]: Start difference. First operand 68 states and 110 transitions. Second operand 11 states. [2019-09-08 06:27:07,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:07,124 INFO L93 Difference]: Finished difference Result 108 states and 210 transitions. [2019-09-08 06:27:07,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 06:27:07,125 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 110 [2019-09-08 06:27:07,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:07,129 INFO L225 Difference]: With dead ends: 108 [2019-09-08 06:27:07,129 INFO L226 Difference]: Without dead ends: 104 [2019-09-08 06:27:07,130 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-09-08 06:27:07,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-08 06:27:07,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2019-09-08 06:27:07,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 06:27:07,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 125 transitions. [2019-09-08 06:27:07,153 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 125 transitions. Word has length 110 [2019-09-08 06:27:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:07,154 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 125 transitions. [2019-09-08 06:27:07,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 06:27:07,154 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 125 transitions. [2019-09-08 06:27:07,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 06:27:07,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:07,158 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:27:07,159 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -839499894, now seen corresponding path program 1 times [2019-09-08 06:27:07,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:07,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:07,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:07,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:07,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:07,300 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 78 proven. 75 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-08 06:27:07,301 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:07,301 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 06:27:07,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:07,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-08 06:27:07,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:07,478 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 48 proven. 128 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 06:27:07,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:07,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 12 [2019-09-08 06:27:07,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 06:27:07,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 06:27:07,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 06:27:07,496 INFO L87 Difference]: Start difference. First operand 72 states and 125 transitions. Second operand 12 states. [2019-09-08 06:27:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:07,783 INFO L93 Difference]: Finished difference Result 125 states and 277 transitions. [2019-09-08 06:27:07,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 06:27:07,784 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-08 06:27:07,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:07,788 INFO L225 Difference]: With dead ends: 125 [2019-09-08 06:27:07,788 INFO L226 Difference]: Without dead ends: 121 [2019-09-08 06:27:07,790 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2019-09-08 06:27:07,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-09-08 06:27:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2019-09-08 06:27:07,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-08 06:27:07,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 120 transitions. [2019-09-08 06:27:07,819 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 120 transitions. Word has length 135 [2019-09-08 06:27:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:07,820 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 120 transitions. [2019-09-08 06:27:07,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 06:27:07,820 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 120 transitions. [2019-09-08 06:27:07,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 06:27:07,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:07,825 INFO L399 BasicCegarLoop]: trace histogram [16, 16, 13, 13, 11, 11, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 06:27:07,826 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash -132328439, now seen corresponding path program 2 times [2019-09-08 06:27:07,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:07,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:07,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 06:27:07,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:07,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 06:27:08,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 184 proven. 225 refuted. 0 times theorem prover too weak. 665 trivial. 0 not checked. [2019-09-08 06:27:08,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 06:27:08,202 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 06:27:08,231 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 06:27:08,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 06:27:08,318 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 06:27:08,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 06:27:08,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 06:27:08,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 118 proven. 214 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-09-08 06:27:08,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 06:27:08,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 21 [2019-09-08 06:27:08,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 06:27:08,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 06:27:08,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2019-09-08 06:27:08,575 INFO L87 Difference]: Start difference. First operand 72 states and 120 transitions. Second operand 21 states. [2019-09-08 06:27:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 06:27:09,514 INFO L93 Difference]: Finished difference Result 201 states and 489 transitions. [2019-09-08 06:27:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 06:27:09,515 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 203 [2019-09-08 06:27:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 06:27:09,518 INFO L225 Difference]: With dead ends: 201 [2019-09-08 06:27:09,521 INFO L226 Difference]: Without dead ends: 73 [2019-09-08 06:27:09,529 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 06:27:09,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-09-08 06:27:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-09-08 06:27:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-09-08 06:27:09,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2019-09-08 06:27:09,563 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 203 [2019-09-08 06:27:09,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 06:27:09,564 INFO L475 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2019-09-08 06:27:09,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 06:27:09,567 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2019-09-08 06:27:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 06:27:09,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 06:27:09,580 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-08 06:27:09,580 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 06:27:09,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 06:27:09,581 INFO L82 PathProgramCache]: Analyzing trace with hash 307857833, now seen corresponding path program 3 times [2019-09-08 06:27:09,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 06:27:09,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 06:27:09,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:09,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 06:27:09,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 06:27:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:27:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-08 06:27:09,690 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-08 06:27:09,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 06:27:09 BoogieIcfgContainer [2019-09-08 06:27:09,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 06:27:09,792 INFO L168 Benchmark]: Toolchain (without parser) took 8385.58 ms. Allocated memory was 142.6 MB in the beginning and 298.8 MB in the end (delta: 156.2 MB). Free memory was 90.5 MB in the beginning and 103.1 MB in the end (delta: -12.6 MB). Peak memory consumption was 143.6 MB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,794 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,794 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.91 ms. Allocated memory is still 142.6 MB. Free memory was 90.3 MB in the beginning and 80.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,795 INFO L168 Benchmark]: Boogie Preprocessor took 170.92 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 80.9 MB in the beginning and 178.5 MB in the end (delta: -97.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,796 INFO L168 Benchmark]: RCFGBuilder took 337.57 ms. Allocated memory is still 200.8 MB. Free memory was 178.5 MB in the beginning and 165.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,797 INFO L168 Benchmark]: TraceAbstraction took 7537.38 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 165.8 MB in the beginning and 103.1 MB in the end (delta: 62.7 MB). Peak memory consumption was 160.7 MB. Max. memory is 7.1 GB. [2019-09-08 06:27:09,801 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 142.6 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 328.91 ms. Allocated memory is still 142.6 MB. Free memory was 90.3 MB in the beginning and 80.9 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 170.92 ms. Allocated memory was 142.6 MB in the beginning and 200.8 MB in the end (delta: 58.2 MB). Free memory was 80.9 MB in the beginning and 178.5 MB in the end (delta: -97.6 MB). Peak memory consumption was 11.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 337.57 ms. Allocated memory is still 200.8 MB. Free memory was 178.5 MB in the beginning and 165.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7537.38 ms. Allocated memory was 200.8 MB in the beginning and 298.8 MB in the end (delta: 98.0 MB). Free memory was 165.8 MB in the beginning and 103.1 MB in the end (delta: 62.7 MB). Peak memory consumption was 160.7 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, 7.3s OverallTime, 11 OverallIterations, 16 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 278 SDslu, 1451 SDs, 0 SdLazy, 1711 SolverSat, 315 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 790 GetRequests, 641 SyntacticMatches, 3 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 130 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1472 NumberOfCodeBlocks, 1472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1277 ConstructedInterpolants, 0 QuantifiedInterpolants, 241441 SizeOfPredicates, 37 NumberOfNonLiveVariables, 1425 ConjunctsInSsa, 75 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 2813/3730 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...