java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-133090d [2018-10-04 09:47:40,303 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 09:47:40,306 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 09:47:40,325 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 09:47:40,325 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 09:47:40,327 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 09:47:40,328 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 09:47:40,330 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 09:47:40,333 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 09:47:40,334 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 09:47:40,335 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 09:47:40,336 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 09:47:40,337 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 09:47:40,338 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 09:47:40,339 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 09:47:40,340 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 09:47:40,341 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 09:47:40,343 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 09:47:40,345 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 09:47:40,346 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 09:47:40,347 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 09:47:40,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 09:47:40,351 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 09:47:40,352 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 09:47:40,352 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 09:47:40,353 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 09:47:40,354 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 09:47:40,355 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 09:47:40,356 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 09:47:40,357 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 09:47:40,357 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 09:47:40,358 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 09:47:40,358 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 09:47:40,358 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 09:47:40,359 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 09:47:40,360 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 09:47:40,361 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-04 09:47:40,378 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 09:47:40,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 09:47:40,379 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 09:47:40,380 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 09:47:40,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 09:47:40,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 09:47:40,381 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 09:47:40,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 09:47:40,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 09:47:40,381 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 09:47:40,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 09:47:40,382 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 09:47:40,382 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 09:47:40,382 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 09:47:40,382 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 09:47:40,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 09:47:40,383 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 09:47:40,383 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 09:47:40,383 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 09:47:40,383 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 09:47:40,383 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 09:47:40,384 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 09:47:40,384 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 09:47:40,384 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 09:47:40,384 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 09:47:40,384 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 09:47:40,385 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 09:47:40,385 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 09:47:40,385 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 09:47:40,385 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 09:47:40,385 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-04 09:47:40,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 09:47:40,456 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 09:47:40,462 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 09:47:40,464 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 09:47:40,465 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 09:47:40,465 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-04 09:47:40,466 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-10-04 09:47:40,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 09:47:40,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 09:47:40,559 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,562 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 09:47:40,562 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 09:47:40,583 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,609 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,620 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 09:47:40,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,622 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 09:47:40,622 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 09:47:40,633 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,664 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/1) ... [2018-10-04 09:47:40,685 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 09:47:40,686 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 09:47:40,686 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 09:47:40,687 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 09:47:40,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (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 [2018-10-04 09:47:40,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 09:47:40,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 09:47:41,421 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 09:47:41,422 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41 BoogieIcfgContainer [2018-10-04 09:47:41,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 09:47:41,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 09:47:41,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 09:47:41,426 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 09:47:41,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 04.10 09:47:40" (1/2) ... [2018-10-04 09:47:41,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ed072a and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 09:47:41, skipping insertion in model container [2018-10-04 09:47:41,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.10 09:47:41" (2/2) ... [2018-10-04 09:47:41,430 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-04 09:47:41,439 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 09:47:41,447 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 09:47:41,497 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 09:47:41,498 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 09:47:41,498 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 09:47:41,498 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 09:47:41,499 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 09:47:41,499 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 09:47:41,499 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 09:47:41,499 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 09:47:41,499 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 09:47:41,515 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 09:47:41,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 09:47:41,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:41,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:41,524 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:41,531 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:41,531 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-04 09:47:41,533 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:41,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:41,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:41,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:41,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:41,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:41,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:41,793 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:41,795 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 09:47:42,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,335 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 09:47:42,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 09:47:42,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,352 INFO L225 Difference]: With dead ends: 56 [2018-10-04 09:47:42,353 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 09:47:42,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:42,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 09:47:42,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 09:47:42,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 09:47:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 09:47:42,401 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 09:47:42,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,402 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 09:47:42,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,402 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 09:47:42,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 09:47:42,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:42,404 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,404 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,404 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-04 09:47:42,405 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:42,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,490 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,490 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 09:47:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:42,688 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 09:47:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:42,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 09:47:42,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:42,690 INFO L225 Difference]: With dead ends: 83 [2018-10-04 09:47:42,690 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 09:47:42,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:42,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 09:47:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 09:47:42,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 09:47:42,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 09:47:42,709 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 09:47:42,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:42,709 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 09:47:42,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:42,710 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 09:47:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:42,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:42,713 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:42,714 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:42,714 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-04 09:47:42,714 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:42,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:42,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:42,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-10-04 09:47:42,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:42,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:42,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:42,836 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:42,836 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 09:47:43,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,042 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 09:47:43,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:43,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,043 INFO L225 Difference]: With dead ends: 106 [2018-10-04 09:47:43,044 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 09:47:43,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:43,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 09:47:43,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 09:47:43,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 09:47:43,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 09:47:43,064 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 09:47:43,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,064 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 09:47:43,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,065 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 09:47:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 09:47:43,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,066 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:43,067 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,068 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-04 09:47:43,068 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-04 09:47:43,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,148 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,149 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 09:47:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:43,534 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 09:47:43,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:43,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 09:47:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:43,539 INFO L225 Difference]: With dead ends: 131 [2018-10-04 09:47:43,539 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 09:47:43,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:43,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 09:47:43,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 09:47:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 09:47:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 09:47:43,554 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 09:47:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:43,555 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 09:47:43,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 09:47:43,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 09:47:43,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:43,558 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:43,558 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:43,558 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:43,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-04 09:47:43,558 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:43,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:43,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:43,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-04 09:47:43,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:43,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:43,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:43,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:43,694 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:43,695 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 09:47:44,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,054 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 09:47:44,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 09:47:44,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,056 INFO L225 Difference]: With dead ends: 153 [2018-10-04 09:47:44,056 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 09:47:44,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:44,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 09:47:44,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 09:47:44,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 09:47:44,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 09:47:44,072 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 09:47:44,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,072 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 09:47:44,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,073 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 09:47:44,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 09:47:44,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,074 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:44,075 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,075 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,075 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-04 09:47:44,075 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,139 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-04 09:47:44,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:44,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,140 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 09:47:44,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,311 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 09:47:44,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 09:47:44,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,313 INFO L225 Difference]: With dead ends: 164 [2018-10-04 09:47:44,313 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 09:47:44,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 09:47:44,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 09:47:44,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 09:47:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 09:47:44,329 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 09:47:44,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,330 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 09:47:44,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 09:47:44,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 09:47:44,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,332 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:44,332 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,332 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-04 09:47:44,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,349 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 09:47:44,349 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 09:47:44,350 INFO L227 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 09:47:44,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,442 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:44,555 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-10-04 09:47:44,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 09:47:44,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,588 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,589 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 09:47:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:44,766 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-04 09:47:44,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:44,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 09:47:44,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:44,768 INFO L225 Difference]: With dead ends: 246 [2018-10-04 09:47:44,768 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 09:47:44,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:44,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 09:47:44,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-04 09:47:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 09:47:44,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-04 09:47:44,806 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-04 09:47:44,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:44,806 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-04 09:47:44,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:44,807 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-04 09:47:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 09:47:44,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:44,809 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:44,810 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:44,810 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:44,810 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-04 09:47:44,810 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:44,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:44,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:44,876 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-04 09:47:44,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:44,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:44,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:44,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:44,878 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:44,878 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-04 09:47:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:45,172 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-04 09:47:45,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:45,172 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-04 09:47:45,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:45,174 INFO L225 Difference]: With dead ends: 250 [2018-10-04 09:47:45,174 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 09:47:45,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:45,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 09:47:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 09:47:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 09:47:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-04 09:47:45,199 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-04 09:47:45,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:45,199 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-04 09:47:45,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-04 09:47:45,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 09:47:45,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:45,202 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:45,202 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:45,202 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-04 09:47:45,203 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:45,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:45,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:45,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:45,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 48 proven. 8 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-10-04 09:47:45,403 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:45,403 INFO L227 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 09:47:45,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:45,481 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:46,264 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 09:47:46,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 09:47:46,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 09:47:46,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 09:47:46,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 09:47:46,286 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:46,287 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-04 09:47:48,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,087 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-04 09:47:48,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 09:47:48,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 09:47:48,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,090 INFO L225 Difference]: With dead ends: 598 [2018-10-04 09:47:48,090 INFO L226 Difference]: Without dead ends: 406 [2018-10-04 09:47:48,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s Time 0.3s impTime 6 [2018-10-04 09:47:48,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-04 09:47:48,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-04 09:47:48,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-04 09:47:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-04 09:47:48,132 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-04 09:47:48,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,133 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-04 09:47:48,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 09:47:48,133 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-04 09:47:48,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 09:47:48,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,135 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:48,136 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,136 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-04 09:47:48,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-10-04 09:47:48,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:48,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:48,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:48,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:48,236 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:48,236 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-04 09:47:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,457 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-04 09:47:48,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-04 09:47:48,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,461 INFO L225 Difference]: With dead ends: 399 [2018-10-04 09:47:48,461 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 09:47:48,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:48,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 09:47:48,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 09:47:48,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 09:47:48,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-04 09:47:48,499 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-04 09:47:48,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:48,500 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-04 09:47:48,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:48,500 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-04 09:47:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 09:47:48,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:48,501 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:48,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:48,502 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:48,502 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-04 09:47:48,502 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:48,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:48,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:48,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-10-04 09:47:48,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:48,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:48,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:48,598 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:48,598 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-04 09:47:48,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:48,964 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-04 09:47:48,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:48,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 09:47:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:48,975 INFO L225 Difference]: With dead ends: 470 [2018-10-04 09:47:48,976 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 09:47:48,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:48,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 09:47:49,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 09:47:49,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 09:47:49,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-04 09:47:49,018 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-04 09:47:49,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,018 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-04 09:47:49,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,019 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-04 09:47:49,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 09:47:49,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,020 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,020 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,020 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,021 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-04 09:47:49,021 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,139 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-10-04 09:47:49,139 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,140 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,140 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-04 09:47:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:49,332 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-04 09:47:49,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:49,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-04 09:47:49,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:49,336 INFO L225 Difference]: With dead ends: 465 [2018-10-04 09:47:49,337 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 09:47:49,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:49,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 09:47:49,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 09:47:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 09:47:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-04 09:47:49,371 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-04 09:47:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:49,371 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-04 09:47:49,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-04 09:47:49,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 09:47:49,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:49,375 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 7, 6, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:49,375 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:49,375 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:49,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-04 09:47:49,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:49,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:49,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:49,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-10-04 09:47:49,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:49,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:49,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:49,523 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:49,523 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-04 09:47:50,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,001 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-04 09:47:50,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:50,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-04 09:47:50,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,004 INFO L225 Difference]: With dead ends: 465 [2018-10-04 09:47:50,004 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 09:47:50,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:50,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 09:47:50,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-04 09:47:50,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-04 09:47:50,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-04 09:47:50,039 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-04 09:47:50,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,039 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-04 09:47:50,039 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-04 09:47:50,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 09:47:50,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,041 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 7, 6, 5, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:50,041 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,041 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,041 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-04 09:47:50,041 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:50,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,151 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-04 09:47:50,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:50,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:50,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:50,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:50,152 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,153 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-04 09:47:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:50,701 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-04 09:47:50,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:50,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-04 09:47:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:50,704 INFO L225 Difference]: With dead ends: 498 [2018-10-04 09:47:50,705 INFO L226 Difference]: Without dead ends: 268 [2018-10-04 09:47:50,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-04 09:47:50,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-04 09:47:50,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 09:47:50,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-04 09:47:50,742 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-04 09:47:50,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:50,742 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-04 09:47:50,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:50,742 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-04 09:47:50,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 09:47:50,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:50,744 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 8, 7, 6, 5, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:50,744 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:50,744 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:50,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-04 09:47:50,745 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:50,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:50,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:50,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 175 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2018-10-04 09:47:50,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:50,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:50,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:50,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:50,854 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:50,854 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-04 09:47:51,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:51,406 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-04 09:47:51,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:51,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-04 09:47:51,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:51,409 INFO L225 Difference]: With dead ends: 561 [2018-10-04 09:47:51,409 INFO L226 Difference]: Without dead ends: 301 [2018-10-04 09:47:51,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:51,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-04 09:47:51,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-04 09:47:51,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 09:47:51,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-04 09:47:51,451 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-04 09:47:51,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:51,451 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-04 09:47:51,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:51,452 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-04 09:47:51,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 09:47:51,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:51,453 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:51,453 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:51,453 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:51,454 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-04 09:47:51,454 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:51,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:51,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:51,588 INFO L134 CoverageAnalysis]: Checked inductivity of 407 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-04 09:47:51,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:51,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:51,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:51,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:51,593 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:51,593 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-04 09:47:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:51,851 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-04 09:47:51,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:51,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 09:47:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:51,855 INFO L225 Difference]: With dead ends: 397 [2018-10-04 09:47:51,855 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 09:47:51,856 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:51,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 09:47:51,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 09:47:51,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 09:47:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-04 09:47:51,908 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-04 09:47:51,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:51,908 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-04 09:47:51,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:51,909 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-04 09:47:51,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 09:47:51,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:51,910 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 12, 11, 10, 9, 8, 7, 6, 5, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:51,911 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:51,911 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:51,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-04 09:47:51,911 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:51,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:51,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:51,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 09:47:51,932 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 09:47:51,932 INFO L227 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 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-04 09:47:51,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:52,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 333 trivial. 0 not checked. [2018-10-04 09:47:52,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 09:47:52,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 09:47:52,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 09:47:52,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 09:47:52,157 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:52,157 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-04 09:47:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:52,305 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-04 09:47:52,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 09:47:52,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-04 09:47:52,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:52,308 INFO L225 Difference]: With dead ends: 782 [2018-10-04 09:47:52,309 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 09:47:52,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-04 09:47:52,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 09:47:52,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 09:47:52,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 09:47:52,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-04 09:47:52,355 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-04 09:47:52,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:52,355 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-04 09:47:52,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 09:47:52,355 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-04 09:47:52,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 09:47:52,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 09:47:52,358 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 16, 15, 14, 12, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 09:47:52,358 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 09:47:52,358 INFO L104 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-04 09:47:52,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-04 09:47:52,359 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 09:47:52,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 09:47:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:52,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:52,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 09:47:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:52,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 09:47:52,635 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 09:47:52,635 INFO L227 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 [2018-10-04 09:47:52,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 09:47:52,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 09:47:52,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 09:47:53,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 740 proven. 8 refuted. 0 times theorem prover too weak. 517 trivial. 0 not checked. [2018-10-04 09:47:53,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 09:47:53,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 09:47:53,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 09:47:53,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 09:47:53,191 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-04 09:47:53,191 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-04 09:47:53,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 09:47:53,713 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-04 09:47:53,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 09:47:53,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 09:47:53,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 09:47:53,714 INFO L225 Difference]: With dead ends: 629 [2018-10-04 09:47:53,714 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 09:47:53,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time 0.0s impTime 3 [2018-10-04 09:47:53,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 09:47:53,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 09:47:53,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 09:47:53,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 09:47:53,716 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 09:47:53,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 09:47:53,716 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 09:47:53,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 09:47:53,716 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 09:47:53,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 09:47:53,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 09:47:53,751 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,792 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,796 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,804 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,805 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,819 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,833 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,836 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,865 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,868 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,869 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,875 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,898 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,916 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:53,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,047 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,072 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,075 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,107 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,118 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,146 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,147 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,156 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:54,163 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 09:47:55,229 WARN L178 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-04 09:47:55,628 WARN L178 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-04 09:47:56,287 WARN L178 SmtUtils]: Spent 580.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-04 09:47:56,389 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-04 09:47:56,524 WARN L178 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-04 09:47:56,925 WARN L178 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-10-04 09:47:57,611 WARN L178 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:57,764 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:58,038 WARN L178 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-04 09:47:58,190 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:58,615 WARN L178 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:58,728 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-04 09:47:58,866 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 09:47:58,870 INFO L421 ceAbstractionStarter]: At program point L345(lines 345 353) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse5 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and .cse0 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 .cse5 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)))) [2018-10-04 09:47:58,870 INFO L421 ceAbstractionStarter]: At program point L304(lines 304 320) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse2 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse3 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse3 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-04 09:47:58,870 INFO L421 ceAbstractionStarter]: At program point L420(lines 420 440) the Hoare annotation is: (let ((.cse0 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1) (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) .cse0 .cse1))) [2018-10-04 09:47:58,870 INFO L421 ceAbstractionStarter]: At program point L482(lines 264 482) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,870 INFO L421 ceAbstractionStarter]: At program point L416(lines 416 427) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:58,871 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-04 09:47:58,871 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-04 09:47:58,871 INFO L421 ceAbstractionStarter]: At program point L408(lines 408 417) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:58,871 INFO L421 ceAbstractionStarter]: At program point L375(lines 375 387) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:58,871 INFO L421 ceAbstractionStarter]: At program point L462(lines 459 477) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:58,871 INFO L421 ceAbstractionStarter]: At program point L429(lines 426 448) the Hoare annotation is: (and (not (= 8656 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:58,871 INFO L421 ceAbstractionStarter]: At program point L355(lines 355 372) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3) .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,872 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-04 09:47:58,872 INFO L421 ceAbstractionStarter]: At program point L273(lines 236 273) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,872 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-04 09:47:58,872 INFO L421 ceAbstractionStarter]: At program point L269(lines 269 288) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,872 INFO L421 ceAbstractionStarter]: At program point L323(lines 323 340) the Hoare annotation is: (let ((.cse2 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse3 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse4 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse0) (and .cse1 .cse0 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)) (and .cse2 .cse3 .cse4 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse3 .cse4 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and .cse1 .cse0 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)))) [2018-10-04 09:47:58,872 INFO L421 ceAbstractionStarter]: At program point L447(lines 447 473) the Hoare annotation is: (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) [2018-10-04 09:47:58,873 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-04 09:47:58,873 INFO L421 ceAbstractionStarter]: At program point L249(lines 249 265) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,873 INFO L421 ceAbstractionStarter]: At program point L439(lines 439 460) the Hoare annotation is: (and (not (= 8672 ULTIMATE.start_ssl3_accept_~s__state~4)) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4)) (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) [2018-10-04 09:47:58,873 INFO L421 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (not (= 8512 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse1 (not (= 8544 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse2 (not (= 8528 ULTIMATE.start_ssl3_accept_~s__state~4))) (.cse3 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4)))) (or (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3)) (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576) (<= ULTIMATE.start_ssl3_accept_~s__state~4 8576) .cse3) (and (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2) .cse0 .cse1 .cse2 .cse3))) [2018-10-04 09:47:58,873 INFO L421 ceAbstractionStarter]: At program point L291(lines 291 301) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 2)) (.cse2 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 3)) (.cse1 (<= ULTIMATE.start_ssl3_accept_~blastFlag~4 3))) (or (and .cse0 (<= ULTIMATE.start_ssl3_accept_~s__s3__tmp__next_state___0~4 8576)) (and (<= 8672 ULTIMATE.start_ssl3_accept_~s__state~4) .cse1) (and .cse0 (not (= 8448 ULTIMATE.start_ssl3_accept_~s__state~4))) (and .cse2 .cse1 (= ULTIMATE.start_ssl3_accept_~s__state~4 8448)) (and .cse2 .cse1 (<= ULTIMATE.start_ssl3_accept_~s__state~4 3)))) [2018-10-04 09:47:58,892 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.10 09:47:58 BoogieIcfgContainer [2018-10-04 09:47:58,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 09:47:58,893 INFO L168 Benchmark]: Toolchain (without parser) took 18336.58 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 151.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 24.0 MB). Peak memory consumption was 608.8 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:58,894 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:58,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:58,895 INFO L168 Benchmark]: Boogie Preprocessor took 64.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 09:47:58,896 INFO L168 Benchmark]: RCFGBuilder took 735.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:58,897 INFO L168 Benchmark]: TraceAbstraction took 17469.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 151.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.7 MB). Peak memory consumption was 577.1 MB. Max. memory is 7.1 GB. [2018-10-04 09:47:58,901 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 64.49 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 735.64 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17469.01 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 151.5 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -7.7 MB). Peak memory consumption was 577.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 17.3s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 7.5s AutomataDifference, 0.0s DeadEndRemovalTime, 5.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_09-47-58-920.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_09-47-58-920.csv Received shutdown request...