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.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-9f4048f [2018-10-04 12:28:06,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-04 12:28:06,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-04 12:28:06,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-04 12:28:06,364 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-04 12:28:06,365 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-04 12:28:06,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-04 12:28:06,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-04 12:28:06,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-04 12:28:06,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-04 12:28:06,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-04 12:28:06,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-04 12:28:06,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-04 12:28:06,374 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-04 12:28:06,375 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-04 12:28:06,376 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-04 12:28:06,376 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-04 12:28:06,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-04 12:28:06,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-04 12:28:06,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-04 12:28:06,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-04 12:28:06,385 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-04 12:28:06,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-04 12:28:06,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-04 12:28:06,387 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-04 12:28:06,388 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-04 12:28:06,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-04 12:28:06,390 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-04 12:28:06,391 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-04 12:28:06,392 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-04 12:28:06,392 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-04 12:28:06,393 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-04 12:28:06,393 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-04 12:28:06,394 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-04 12:28:06,395 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-04 12:28:06,396 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-04 12:28:06,396 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-04 12:28:06,411 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-04 12:28:06,411 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-04 12:28:06,412 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-04 12:28:06,412 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-04 12:28:06,413 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-04 12:28:06,413 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-04 12:28:06,413 INFO L133 SettingsManager]: * Use SBE=true [2018-10-04 12:28:06,414 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-04 12:28:06,414 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-04 12:28:06,414 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-04 12:28:06,414 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-04 12:28:06,414 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-04 12:28:06,414 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-04 12:28:06,415 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-04 12:28:06,415 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-04 12:28:06,415 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-04 12:28:06,415 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-04 12:28:06,415 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-04 12:28:06,416 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-04 12:28:06,416 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-04 12:28:06,416 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-04 12:28:06,416 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-04 12:28:06,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-04 12:28:06,417 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-04 12:28:06,417 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-04 12:28:06,417 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-04 12:28:06,417 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-04 12:28:06,417 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-04 12:28:06,417 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-04 12:28:06,418 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-04 12:28:06,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-04 12:28:06,478 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-04 12:28:06,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-04 12:28:06,483 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-04 12:28:06,484 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-04 12:28:06,485 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 12:28:06,485 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 12:28:06,584 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-04 12:28:06,586 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-04 12:28:06,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:06,587 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-04 12:28:06,587 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-04 12:28:06,609 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,627 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,634 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-04 12:28:06,635 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-04 12:28:06,635 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-04 12:28:06,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-04 12:28:06,648 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,648 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,651 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,652 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,661 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,664 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,667 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 12:28:06" (1/1) ... [2018-10-04 12:28:06,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-04 12:28:06,672 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-04 12:28:06,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-04 12:28:06,672 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-04 12:28:06,673 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 12:28:06" (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 12:28:06,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-04 12:28:06,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-04 12:28:07,502 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-04 12:28:07,503 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 12:28:07 BoogieIcfgContainer [2018-10-04 12:28:07,503 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-04 12:28:07,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-04 12:28:07,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-04 12:28:07,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-04 12:28:07,508 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 12:28:06" (1/2) ... [2018-10-04 12:28:07,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@898fbeb and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.10 12:28:07, skipping insertion in model container [2018-10-04 12:28:07,509 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 12:28:07" (2/2) ... [2018-10-04 12:28:07,511 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-04 12:28:07,521 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-04 12:28:07,534 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-04 12:28:07,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-04 12:28:07,586 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-04 12:28:07,586 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-04 12:28:07,586 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-04 12:28:07,586 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-04 12:28:07,587 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-04 12:28:07,587 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-04 12:28:07,587 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-04 12:28:07,587 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-04 12:28:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-04 12:28:07,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-04 12:28:07,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:07,612 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-04 12:28:07,614 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:07,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:07,620 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-04 12:28:07,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:07,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:07,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:07,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:07,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:07,852 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 12:28:07,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:07,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:07,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:07,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:07,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:07,876 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-04 12:28:08,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:08,267 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-04 12:28:08,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:08,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-04 12:28:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:08,283 INFO L225 Difference]: With dead ends: 56 [2018-10-04 12:28:08,283 INFO L226 Difference]: Without dead ends: 34 [2018-10-04 12:28:08,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-04 12:28:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-04 12:28:08,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-04 12:28:08,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-04 12:28:08,332 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-04 12:28:08,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:08,332 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-04 12:28:08,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:08,333 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-04 12:28:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-04 12:28:08,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:08,334 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 12:28:08,334 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:08,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:08,335 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-04 12:28:08,335 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:08,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:08,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:08,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:08,436 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 12:28:08,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:08,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:08,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:08,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,440 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-04 12:28:08,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:08,626 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-04 12:28:08,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:08,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-04 12:28:08,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:08,628 INFO L225 Difference]: With dead ends: 83 [2018-10-04 12:28:08,628 INFO L226 Difference]: Without dead ends: 50 [2018-10-04 12:28:08,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-04 12:28:08,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-04 12:28:08,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-04 12:28:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-04 12:28:08,644 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-04 12:28:08,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:08,645 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-04 12:28:08,645 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:08,645 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-04 12:28:08,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:28:08,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:08,647 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 12:28:08,647 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:08,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:08,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-04 12:28:08,648 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:08,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:08,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:08,756 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 12:28:08,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:08,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:08,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:08,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:08,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:08,759 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-04 12:28:09,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:09,017 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-04 12:28:09,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:09,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:28:09,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:09,021 INFO L225 Difference]: With dead ends: 106 [2018-10-04 12:28:09,022 INFO L226 Difference]: Without dead ends: 57 [2018-10-04 12:28:09,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-04 12:28:09,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-04 12:28:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-04 12:28:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-04 12:28:09,055 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-04 12:28:09,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:09,055 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-04 12:28:09,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:09,056 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-04 12:28:09,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-04 12:28:09,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:09,059 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 12:28:09,060 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:09,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:09,061 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-04 12:28:09,062 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:09,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:09,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:09,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,179 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 12:28:09,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:09,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,181 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-04 12:28:09,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:09,653 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-04 12:28:09,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:09,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-04 12:28:09,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:09,655 INFO L225 Difference]: With dead ends: 131 [2018-10-04 12:28:09,660 INFO L226 Difference]: Without dead ends: 74 [2018-10-04 12:28:09,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-04 12:28:09,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-04 12:28:09,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-04 12:28:09,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-04 12:28:09,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-04 12:28:09,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:09,685 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-04 12:28:09,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-04 12:28:09,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-04 12:28:09,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:09,689 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 12:28:09,689 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:09,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:09,690 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-04 12:28:09,690 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:09,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:09,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:09,787 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 12:28:09,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:09,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:09,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:09,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:09,790 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-04 12:28:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,211 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-04 12:28:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-04 12:28:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,213 INFO L225 Difference]: With dead ends: 153 [2018-10-04 12:28:10,213 INFO L226 Difference]: Without dead ends: 80 [2018-10-04 12:28:10,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-04 12:28:10,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-04 12:28:10,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-04 12:28:10,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-04 12:28:10,230 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-04 12:28:10,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,230 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-04 12:28:10,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,231 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-04 12:28:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-04 12:28:10,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,233 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 12:28:10,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-04 12:28:10,234 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,300 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 12:28:10,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:10,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:10,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:10,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,302 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-04 12:28:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,515 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-04 12:28:10,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-04 12:28:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,519 INFO L225 Difference]: With dead ends: 164 [2018-10-04 12:28:10,519 INFO L226 Difference]: Without dead ends: 85 [2018-10-04 12:28:10,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-04 12:28:10,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-04 12:28:10,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-04 12:28:10,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-04 12:28:10,535 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-04 12:28:10,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,536 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-04 12:28:10,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,536 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-04 12:28:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-04 12:28:10,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,538 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 12:28:10,538 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-04 12:28:10,539 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,552 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 12:28:10,553 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 12:28:10,553 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 12:28:10,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:10,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:10,726 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 12:28:10,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:10,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-04 12:28:10,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:10,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:10,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,751 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-04 12:28:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:10,888 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-04 12:28:10,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:10,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-04 12:28:10,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:10,891 INFO L225 Difference]: With dead ends: 246 [2018-10-04 12:28:10,891 INFO L226 Difference]: Without dead ends: 162 [2018-10-04 12:28:10,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-04 12:28:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-04 12:28:10,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-04 12:28:10,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-04 12:28:10,930 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-04 12:28:10,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:10,934 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-04 12:28:10,935 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-04 12:28:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-04 12:28:10,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:10,940 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 12:28:10,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:10,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:10,940 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-04 12:28:10,941 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:10,941 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:10,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:10,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:10,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:11,053 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 12:28:11,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:11,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:11,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:11,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:11,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:11,058 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-04 12:28:11,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:11,329 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-04 12:28:11,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:11,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-04 12:28:11,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:11,331 INFO L225 Difference]: With dead ends: 250 [2018-10-04 12:28:11,331 INFO L226 Difference]: Without dead ends: 166 [2018-10-04 12:28:11,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:11,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-04 12:28:11,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-04 12:28:11,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-04 12:28:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-04 12:28:11,370 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-04 12:28:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:11,370 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-04 12:28:11,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:11,370 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-04 12:28:11,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-04 12:28:11,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:11,383 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 12:28:11,384 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:11,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-04 12:28:11,384 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:11,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:11,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:11,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:11,536 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 12:28:11,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:11,537 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 12:28:11,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:11,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:11,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:11,689 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 12:28:11,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-04 12:28:11,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-04 12:28:11,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-04 12:28:11,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-04 12:28:11,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:11,724 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-04 12:28:12,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:12,910 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-04 12:28:12,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-04 12:28:12,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-04 12:28:12,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:12,914 INFO L225 Difference]: With dead ends: 598 [2018-10-04 12:28:12,914 INFO L226 Difference]: Without dead ends: 406 [2018-10-04 12:28:12,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-04 12:28:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-04 12:28:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-04 12:28:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-04 12:28:12,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-04 12:28:12,963 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-04 12:28:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:12,963 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-04 12:28:12,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-04 12:28:12,963 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-04 12:28:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-04 12:28:12,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:12,965 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 12:28:12,966 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:12,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-04 12:28:12,966 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:12,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:12,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:12,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:12,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:13,048 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 12:28:13,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:13,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:13,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:13,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:13,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,050 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-04 12:28:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:13,408 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-04 12:28:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:13,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-04 12:28:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:13,413 INFO L225 Difference]: With dead ends: 399 [2018-10-04 12:28:13,413 INFO L226 Difference]: Without dead ends: 239 [2018-10-04 12:28:13,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-04 12:28:13,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-04 12:28:13,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-04 12:28:13,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-04 12:28:13,449 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-04 12:28:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:13,450 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-04 12:28:13,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-04 12:28:13,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-04 12:28:13,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:13,451 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 12:28:13,452 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:13,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:13,452 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-04 12:28:13,452 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:13,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:13,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:13,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:13,539 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 12:28:13,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:13,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:13,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:13,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,541 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-04 12:28:13,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:13,653 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-04 12:28:13,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:13,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-04 12:28:13,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:13,656 INFO L225 Difference]: With dead ends: 470 [2018-10-04 12:28:13,656 INFO L226 Difference]: Without dead ends: 237 [2018-10-04 12:28:13,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-04 12:28:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-04 12:28:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-04 12:28:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-04 12:28:13,686 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-04 12:28:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:13,687 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-04 12:28:13,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-04 12:28:13,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-04 12:28:13,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:13,688 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 12:28:13,688 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:13,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:13,689 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-04 12:28:13,689 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:13,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:13,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:13,782 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 12:28:13,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:13,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:13,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:13,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:13,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,783 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-04 12:28:13,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:13,921 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-04 12:28:13,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:13,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-04 12:28:13,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:13,924 INFO L225 Difference]: With dead ends: 465 [2018-10-04 12:28:13,924 INFO L226 Difference]: Without dead ends: 235 [2018-10-04 12:28:13,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:13,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-04 12:28:13,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-04 12:28:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-04 12:28:13,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-04 12:28:13,958 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-04 12:28:13,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:13,959 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-04 12:28:13,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:13,959 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-04 12:28:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-04 12:28:13,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:13,960 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 12:28:13,961 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:13,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:13,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-04 12:28:13,961 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:13,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:13,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:13,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:14,066 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 12:28:14,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:14,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:14,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:14,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:14,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:14,095 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-04 12:28:14,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:14,434 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-04 12:28:14,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:14,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-04 12:28:14,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:14,437 INFO L225 Difference]: With dead ends: 465 [2018-10-04 12:28:14,437 INFO L226 Difference]: Without dead ends: 238 [2018-10-04 12:28:14,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-04 12:28:14,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-04 12:28:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-04 12:28:14,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-04 12:28:14,463 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-04 12:28:14,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:14,463 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-04 12:28:14,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-04 12:28:14,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-04 12:28:14,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:14,465 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 12:28:14,465 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:14,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:14,465 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-04 12:28:14,466 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:14,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:14,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:14,562 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 12:28:14,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:14,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:14,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:14,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:14,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:14,564 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-04 12:28:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:15,124 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-04 12:28:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:15,125 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-04 12:28:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:15,127 INFO L225 Difference]: With dead ends: 498 [2018-10-04 12:28:15,127 INFO L226 Difference]: Without dead ends: 268 [2018-10-04 12:28:15,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-04 12:28:15,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-04 12:28:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-04 12:28:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-04 12:28:15,160 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-04 12:28:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:15,161 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-04 12:28:15,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:15,161 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-04 12:28:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-04 12:28:15,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:15,162 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 12:28:15,163 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:15,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-04 12:28:15,163 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:15,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:15,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:15,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:15,255 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 12:28:15,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:15,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:15,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:15,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:15,257 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-04 12:28:15,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:15,614 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-04 12:28:15,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:15,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-04 12:28:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:15,616 INFO L225 Difference]: With dead ends: 561 [2018-10-04 12:28:15,617 INFO L226 Difference]: Without dead ends: 301 [2018-10-04 12:28:15,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:15,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-04 12:28:15,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-04 12:28:15,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-04 12:28:15,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-04 12:28:15,652 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-04 12:28:15,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:15,653 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-04 12:28:15,653 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-04 12:28:15,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-04 12:28:15,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:15,654 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 12:28:15,655 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:15,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-04 12:28:15,655 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:15,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:15,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:15,762 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 12:28:15,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:15,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:15,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:15,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:15,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:15,764 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-04 12:28:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:15,892 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-04 12:28:15,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:15,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-04 12:28:15,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:15,901 INFO L225 Difference]: With dead ends: 397 [2018-10-04 12:28:15,901 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 12:28:15,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:15,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 12:28:15,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 12:28:15,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 12:28:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-04 12:28:15,951 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-04 12:28:15,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:15,951 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-04 12:28:15,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-04 12:28:15,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-04 12:28:15,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:15,954 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 12:28:15,954 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:15,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:15,954 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-04 12:28:15,955 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:15,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:15,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:15,974 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-04 12:28:15,975 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-04 12:28:15,975 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 12:28:15,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:16,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:16,144 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 12:28:16,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-04 12:28:16,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-04 12:28:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-04 12:28:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-04 12:28:16,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:16,177 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-04 12:28:16,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:16,777 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-04 12:28:16,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-04 12:28:16,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-04 12:28:16,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:16,780 INFO L225 Difference]: With dead ends: 782 [2018-10-04 12:28:16,781 INFO L226 Difference]: Without dead ends: 395 [2018-10-04 12:28:16,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-04 12:28:16,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-04 12:28:16,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-04 12:28:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-04 12:28:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-04 12:28:16,828 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-04 12:28:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:16,828 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-04 12:28:16,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-04 12:28:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-04 12:28:16,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-04 12:28:16,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-04 12:28:16,830 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 12:28:16,831 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-04 12:28:16,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-04 12:28:16,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-04 12:28:16,831 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-04 12:28:16,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-04 12:28:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:16,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-04 12:28:16,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-04 12:28:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:17,013 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 12:28:17,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-04 12:28:17,014 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) [2018-10-04 12:28:17,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-04 12:28:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-04 12:28:17,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-04 12:28:17,201 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 12:28:17,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-04 12:28:17,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-04 12:28:17,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-04 12:28:17,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-04 12:28:17,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-04 12:28:17,240 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-04 12:28:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-04 12:28:17,709 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-04 12:28:17,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-04 12:28:17,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-04 12:28:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-04 12:28:17,710 INFO L225 Difference]: With dead ends: 629 [2018-10-04 12:28:17,710 INFO L226 Difference]: Without dead ends: 0 [2018-10-04 12:28:17,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-04 12:28:17,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-04 12:28:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-04 12:28:17,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-04 12:28:17,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-04 12:28:17,712 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-04 12:28:17,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-04 12:28:17,712 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-04 12:28:17,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-04 12:28:17,713 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-04 12:28:17,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-04 12:28:17,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-04 12:28:17,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,737 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,766 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,772 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,774 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,780 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,826 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,844 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,860 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,866 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,888 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,889 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,895 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,918 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,921 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,923 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,946 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,947 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,948 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,954 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,974 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,988 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,989 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:17,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,001 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,043 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,050 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:18,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-04 12:28:19,058 WARN L178 SmtUtils]: Spent 996.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-04 12:28:19,532 WARN L178 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-04 12:28:19,971 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-04 12:28:20,117 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-04 12:28:20,225 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-04 12:28:20,385 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 12:28:20,490 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 12:28:20,863 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 12:28:21,048 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 12:28:21,156 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-04 12:28:21,295 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-04 12:28:21,298 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 12:28:21,298 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 12:28:21,298 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 12:28:21,299 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 12:28:21,299 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 12:28:21,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-04 12:28:21,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-04 12:28:21,299 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-04 12:28:21,300 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 12:28:21,300 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 12:28:21,300 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 12:28:21,300 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 12:28:21,300 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 12:28:21,300 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-04 12:28:21,300 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 12:28:21,300 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 12:28:21,301 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 12:28:21,301 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 12:28:21,301 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-04 12:28:21,301 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 12:28:21,301 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 12:28:21,301 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 12:28:21,301 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 12:28:21,319 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 12:28:21 BoogieIcfgContainer [2018-10-04 12:28:21,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-04 12:28:21,320 INFO L168 Benchmark]: Toolchain (without parser) took 14735.39 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 147.3 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 9.7 MB). Peak memory consumption was 604.8 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:21,321 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:21,322 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:21,322 INFO L168 Benchmark]: Boogie Preprocessor took 36.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-04 12:28:21,323 INFO L168 Benchmark]: RCFGBuilder took 831.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 12:28:21,323 INFO L168 Benchmark]: TraceAbstraction took 13814.95 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 147.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -22.0 MB). Peak memory consumption was 573.0 MB. Max. memory is 7.1 GB. [2018-10-04 12:28:21,327 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.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 48.41 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.42 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 831.22 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 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 13814.95 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 147.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -22.0 MB). Peak memory consumption was 573.0 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, 13.7s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.7s AutomataDifference, 0.0s DeadEndRemovalTime, 3.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.2s 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.3s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s 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.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-04_12-28-21-345.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.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-04_12-28-21-345.csv Received shutdown request...