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-c372c2b [2018-10-02 11:49:17,114 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-02 11:49:17,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-02 11:49:17,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-02 11:49:17,129 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-02 11:49:17,130 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-02 11:49:17,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-02 11:49:17,134 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-02 11:49:17,139 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-02 11:49:17,142 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-02 11:49:17,143 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-02 11:49:17,144 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-02 11:49:17,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-02 11:49:17,151 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-02 11:49:17,152 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-02 11:49:17,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-02 11:49:17,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-02 11:49:17,160 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-02 11:49:17,164 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-02 11:49:17,166 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-02 11:49:17,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-02 11:49:17,172 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-02 11:49:17,178 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-02 11:49:17,178 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-02 11:49:17,179 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-02 11:49:17,180 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-02 11:49:17,182 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-02 11:49:17,182 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-02 11:49:17,183 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-02 11:49:17,186 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-02 11:49:17,186 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-02 11:49:17,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-02 11:49:17,188 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-02 11:49:17,188 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-02 11:49:17,189 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-02 11:49:17,192 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-02 11:49:17,192 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-02 11:49:17,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-02 11:49:17,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-02 11:49:17,217 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-02 11:49:17,218 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-02 11:49:17,218 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-02 11:49:17,219 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-02 11:49:17,219 INFO L133 SettingsManager]: * Use SBE=true [2018-10-02 11:49:17,219 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-02 11:49:17,219 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-02 11:49:17,219 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-02 11:49:17,220 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-02 11:49:17,220 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-02 11:49:17,220 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-02 11:49:17,220 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-02 11:49:17,221 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-02 11:49:17,222 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-02 11:49:17,222 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-02 11:49:17,222 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-02 11:49:17,222 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-02 11:49:17,224 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-02 11:49:17,224 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-02 11:49:17,224 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-02 11:49:17,224 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-02 11:49:17,224 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-02 11:49:17,225 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-02 11:49:17,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-02 11:49:17,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-02 11:49:17,327 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-02 11:49:17,329 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-02 11:49:17,330 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-02 11:49:17,331 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-02 11:49:17,331 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-02 11:49:17,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-02 11:49:17,442 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-02 11:49:17,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:17,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-02 11:49:17,443 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-02 11:49:17,463 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,483 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-02 11:49:17,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-02 11:49:17,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-02 11:49:17,503 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-02 11:49:17,514 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,515 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,521 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,521 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,545 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,552 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,562 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 02.10 11:49:17" (1/1) ... [2018-10-02 11:49:17,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-02 11:49:17,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-02 11:49:17,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-02 11:49:17,572 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-02 11:49:17,576 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 02.10 11:49:17" (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-02 11:49:17,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-02 11:49:17,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-02 11:49:18,359 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-02 11:49:18,360 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 02.10 11:49:18 BoogieIcfgContainer [2018-10-02 11:49:18,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-02 11:49:18,361 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-02 11:49:18,361 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-02 11:49:18,365 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-02 11:49:18,365 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 02.10 11:49:17" (1/2) ... [2018-10-02 11:49:18,366 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 02.10 11:49:18, skipping insertion in model container [2018-10-02 11:49:18,366 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 02.10 11:49:18" (2/2) ... [2018-10-02 11:49:18,368 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-02 11:49:18,381 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-02 11:49:18,392 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-02 11:49:18,444 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-02 11:49:18,444 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-02 11:49:18,445 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-02 11:49:18,445 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-02 11:49:18,445 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-02 11:49:18,445 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-02 11:49:18,445 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-02 11:49:18,445 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-02 11:49:18,446 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-02 11:49:18,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-02 11:49:18,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-02 11:49:18,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:18,470 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:18,471 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:18,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-02 11:49:18,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:18,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:18,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:18,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:18,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:18,715 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-02 11:49:18,717 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:18,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:18,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:18,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:18,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:18,737 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-02 11:49:19,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:19,135 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-02 11:49:19,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:19,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-02 11:49:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:19,150 INFO L225 Difference]: With dead ends: 56 [2018-10-02 11:49:19,150 INFO L226 Difference]: Without dead ends: 34 [2018-10-02 11:49:19,157 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-02 11:49:19,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-02 11:49:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-02 11:49:19,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-02 11:49:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-02 11:49:19,198 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-02 11:49:19,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:19,198 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-02 11:49:19,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:19,199 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-02 11:49:19,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-02 11:49:19,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:19,200 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-02 11:49:19,201 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:19,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:19,202 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-02 11:49:19,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:19,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:19,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:19,300 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-02 11:49:19,301 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:19,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:19,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,308 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-02 11:49:19,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:19,485 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-02 11:49:19,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:19,486 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-02 11:49:19,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:19,487 INFO L225 Difference]: With dead ends: 83 [2018-10-02 11:49:19,488 INFO L226 Difference]: Without dead ends: 50 [2018-10-02 11:49:19,489 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-02 11:49:19,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-02 11:49:19,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-02 11:49:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-02 11:49:19,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-02 11:49:19,503 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-02 11:49:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:19,503 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-02 11:49:19,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-02 11:49:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:49:19,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:19,505 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-02 11:49:19,505 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:19,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-02 11:49:19,506 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:19,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:19,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:19,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:19,630 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-02 11:49:19,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:19,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:19,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:19,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:19,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,633 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-02 11:49:19,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:19,825 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-02 11:49:19,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:19,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:49:19,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:19,829 INFO L225 Difference]: With dead ends: 106 [2018-10-02 11:49:19,829 INFO L226 Difference]: Without dead ends: 57 [2018-10-02 11:49:19,830 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-02 11:49:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-02 11:49:19,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-02 11:49:19,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-02 11:49:19,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-02 11:49:19,843 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-02 11:49:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:19,844 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-02 11:49:19,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:19,844 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-02 11:49:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-02 11:49:19,845 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:19,846 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-02 11:49:19,846 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:19,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:19,847 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-02 11:49:19,847 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:19,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:19,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:19,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:19,948 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-02 11:49:19,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:19,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:19,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:19,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:19,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:19,950 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-02 11:49:20,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:20,404 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-02 11:49:20,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:20,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-02 11:49:20,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:20,406 INFO L225 Difference]: With dead ends: 131 [2018-10-02 11:49:20,406 INFO L226 Difference]: Without dead ends: 74 [2018-10-02 11:49:20,408 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-02 11:49:20,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-02 11:49:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-02 11:49:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-02 11:49:20,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-02 11:49:20,425 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-02 11:49:20,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:20,426 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-02 11:49:20,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:20,426 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-02 11:49:20,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-02 11:49:20,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:20,428 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-02 11:49:20,428 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:20,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:20,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-02 11:49:20,429 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:20,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:20,483 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-02 11:49:20,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:20,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:20,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:20,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:20,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:20,485 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-02 11:49:20,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:20,935 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-02 11:49:20,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:20,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-02 11:49:20,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:20,937 INFO L225 Difference]: With dead ends: 153 [2018-10-02 11:49:20,938 INFO L226 Difference]: Without dead ends: 80 [2018-10-02 11:49:20,939 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-02 11:49:20,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-02 11:49:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-02 11:49:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-02 11:49:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-02 11:49:20,953 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-02 11:49:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:20,954 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-02 11:49:20,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-02 11:49:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-02 11:49:20,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:20,956 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-02 11:49:20,956 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:20,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:20,957 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-02 11:49:20,957 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:20,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:20,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:21,022 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-02 11:49:21,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:21,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:21,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:21,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:21,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:21,024 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-02 11:49:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:21,164 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-02 11:49:21,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:21,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-02 11:49:21,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:21,169 INFO L225 Difference]: With dead ends: 164 [2018-10-02 11:49:21,169 INFO L226 Difference]: Without dead ends: 85 [2018-10-02 11:49:21,170 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-02 11:49:21,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-02 11:49:21,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-02 11:49:21,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-02 11:49:21,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-02 11:49:21,185 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-02 11:49:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:21,186 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-02 11:49:21,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-02 11:49:21,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-02 11:49:21,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:21,188 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-02 11:49:21,188 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:21,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:21,189 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-02 11:49:21,189 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:21,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:21,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:21,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,202 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 11:49:21,203 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 11:49:21,203 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-02 11:49:21,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:21,305 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:21,328 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-02 11:49:21,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:21,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-02 11:49:21,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:21,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:21,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:21,352 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-02 11:49:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:21,485 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-02 11:49:21,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:21,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-02 11:49:21,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:21,487 INFO L225 Difference]: With dead ends: 246 [2018-10-02 11:49:21,487 INFO L226 Difference]: Without dead ends: 162 [2018-10-02 11:49:21,488 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-02 11:49:21,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-02 11:49:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-02 11:49:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-02 11:49:21,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-02 11:49:21,534 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-02 11:49:21,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:21,535 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-02 11:49:21,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:21,535 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-02 11:49:21,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-02 11:49:21,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:21,542 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-02 11:49:21,542 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:21,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:21,546 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-02 11:49:21,547 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:21,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:21,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:21,664 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-02 11:49:21,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:21,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:21,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:21,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:21,669 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-02 11:49:21,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:21,917 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-02 11:49:21,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:21,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-02 11:49:21,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:21,921 INFO L225 Difference]: With dead ends: 250 [2018-10-02 11:49:21,921 INFO L226 Difference]: Without dead ends: 166 [2018-10-02 11:49:21,922 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-02 11:49:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-02 11:49:21,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-02 11:49:21,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-02 11:49:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-02 11:49:21,947 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-02 11:49:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:21,947 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-02 11:49:21,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-02 11:49:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-02 11:49:21,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:21,949 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-02 11:49:21,949 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:21,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:21,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-02 11:49:21,950 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:21,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:21,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:22,149 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-02 11:49:22,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:22,150 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-02 11:49:22,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:22,241 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:22,316 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-02 11:49:22,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-02 11:49:22,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-02 11:49:22,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-02 11:49:22,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-02 11:49:22,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-02 11:49:22,348 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-02 11:49:23,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:23,551 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-02 11:49:23,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-02 11:49:23,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-02 11:49:23,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:23,555 INFO L225 Difference]: With dead ends: 598 [2018-10-02 11:49:23,555 INFO L226 Difference]: Without dead ends: 406 [2018-10-02 11:49:23,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-02 11:49:23,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-02 11:49:23,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-02 11:49:23,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-02 11:49:23,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-02 11:49:23,610 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-02 11:49:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:23,610 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-02 11:49:23,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-02 11:49:23,611 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-02 11:49:23,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-02 11:49:23,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:23,612 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-02 11:49:23,613 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:23,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:23,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-02 11:49:23,613 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:23,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:23,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:23,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:23,711 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-02 11:49:23,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:23,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:23,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:23,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:23,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:23,713 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-02 11:49:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:24,081 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-02 11:49:24,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:24,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-02 11:49:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:24,083 INFO L225 Difference]: With dead ends: 399 [2018-10-02 11:49:24,084 INFO L226 Difference]: Without dead ends: 239 [2018-10-02 11:49:24,084 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-02 11:49:24,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-02 11:49:24,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-02 11:49:24,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-02 11:49:24,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-02 11:49:24,118 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-02 11:49:24,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:24,118 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-02 11:49:24,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:24,119 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-02 11:49:24,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-02 11:49:24,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:24,120 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-02 11:49:24,120 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:24,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:24,121 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-02 11:49:24,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:24,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:24,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:24,223 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-02 11:49:24,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:24,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:24,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:24,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:24,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,226 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-02 11:49:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:24,359 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-02 11:49:24,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:24,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-02 11:49:24,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:24,361 INFO L225 Difference]: With dead ends: 470 [2018-10-02 11:49:24,362 INFO L226 Difference]: Without dead ends: 237 [2018-10-02 11:49:24,362 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-02 11:49:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-02 11:49:24,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-02 11:49:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-02 11:49:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-02 11:49:24,394 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-02 11:49:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:24,394 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-02 11:49:24,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:24,395 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-02 11:49:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-02 11:49:24,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:24,396 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-02 11:49:24,397 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:24,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:24,397 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-02 11:49:24,397 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:24,397 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:24,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:24,488 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-02 11:49:24,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:24,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:24,489 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:24,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,490 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-02 11:49:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:24,639 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-02 11:49:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:24,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-02 11:49:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:24,646 INFO L225 Difference]: With dead ends: 465 [2018-10-02 11:49:24,646 INFO L226 Difference]: Without dead ends: 235 [2018-10-02 11:49:24,647 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-02 11:49:24,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-02 11:49:24,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-02 11:49:24,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-02 11:49:24,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-02 11:49:24,677 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-02 11:49:24,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:24,678 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-02 11:49:24,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:24,678 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-02 11:49:24,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-02 11:49:24,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:24,679 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-02 11:49:24,680 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:24,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:24,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-02 11:49:24,680 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:24,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:24,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:24,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:24,781 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-02 11:49:24,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:24,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:24,783 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-02 11:49:25,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:25,169 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-02 11:49:25,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:25,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-02 11:49:25,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:25,171 INFO L225 Difference]: With dead ends: 465 [2018-10-02 11:49:25,171 INFO L226 Difference]: Without dead ends: 238 [2018-10-02 11:49:25,172 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-02 11:49:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-02 11:49:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-02 11:49:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-02 11:49:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-02 11:49:25,199 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-02 11:49:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:25,199 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-02 11:49:25,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:25,199 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-02 11:49:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-02 11:49:25,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:25,201 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-02 11:49:25,201 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:25,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:25,201 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-02 11:49:25,201 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:25,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:25,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:25,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:25,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:25,296 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-02 11:49:25,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:25,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:25,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:25,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:25,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:25,298 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-02 11:49:25,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:25,843 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-02 11:49:25,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:25,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-02 11:49:25,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:25,845 INFO L225 Difference]: With dead ends: 498 [2018-10-02 11:49:25,845 INFO L226 Difference]: Without dead ends: 268 [2018-10-02 11:49:25,846 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-02 11:49:25,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-02 11:49:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-02 11:49:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-02 11:49:25,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-02 11:49:25,878 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-02 11:49:25,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:25,879 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-02 11:49:25,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:25,879 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-02 11:49:25,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-02 11:49:25,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:25,881 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-02 11:49:25,881 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:25,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:25,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-02 11:49:25,881 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:25,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:25,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:25,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:25,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:25,987 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-02 11:49:25,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:25,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:25,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:25,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:25,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:25,989 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-02 11:49:26,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:26,334 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-02 11:49:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:26,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-02 11:49:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:26,336 INFO L225 Difference]: With dead ends: 561 [2018-10-02 11:49:26,336 INFO L226 Difference]: Without dead ends: 301 [2018-10-02 11:49:26,337 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-02 11:49:26,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-02 11:49:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-02 11:49:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-02 11:49:26,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-02 11:49:26,371 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-02 11:49:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:26,372 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-02 11:49:26,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-02 11:49:26,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-02 11:49:26,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:26,374 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-02 11:49:26,374 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:26,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:26,374 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-02 11:49:26,374 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:26,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:26,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:26,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:26,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:26,491 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-02 11:49:26,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:26,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:26,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:26,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:26,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:26,492 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-02 11:49:26,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:26,649 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-02 11:49:26,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:26,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-02 11:49:26,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:26,652 INFO L225 Difference]: With dead ends: 397 [2018-10-02 11:49:26,652 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 11:49:26,653 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-02 11:49:26,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 11:49:26,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 11:49:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 11:49:26,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-02 11:49:26,700 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-02 11:49:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:26,701 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-02 11:49:26,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-02 11:49:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-02 11:49:26,703 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:26,703 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-02 11:49:26,703 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:26,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:26,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-02 11:49:26,704 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:26,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:26,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:26,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:26,724 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-02 11:49:26,724 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-02 11:49:26,724 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-02 11:49:26,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:26,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:26,907 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-02 11:49:26,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-02 11:49:26,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-02 11:49:26,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-02 11:49:26,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-02 11:49:26,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-02 11:49:26,940 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-02 11:49:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:27,290 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-02 11:49:27,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-02 11:49:27,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-02 11:49:27,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:27,292 INFO L225 Difference]: With dead ends: 782 [2018-10-02 11:49:27,292 INFO L226 Difference]: Without dead ends: 395 [2018-10-02 11:49:27,293 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-02 11:49:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-02 11:49:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-02 11:49:27,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-02 11:49:27,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-02 11:49:27,335 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-02 11:49:27,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:27,336 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-02 11:49:27,336 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-02 11:49:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-02 11:49:27,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-02 11:49:27,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-02 11:49:27,338 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-02 11:49:27,339 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-02 11:49:27,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-02 11:49:27,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-02 11:49:27,339 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-02 11:49:27,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-02 11:49:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:27,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:27,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-02 11:49:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:27,545 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-02 11:49:27,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-02 11:49:27,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-02 11:49:27,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-02 11:49:27,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-02 11:49:27,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-02 11:49:27,748 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-02 11:49:27,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-02 11:49:27,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-02 11:49:27,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-02 11:49:27,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-02 11:49:27,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-02 11:49:27,783 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-02 11:49:28,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-02 11:49:28,193 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-02 11:49:28,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-02 11:49:28,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-02 11:49:28,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-02 11:49:28,194 INFO L225 Difference]: With dead ends: 629 [2018-10-02 11:49:28,194 INFO L226 Difference]: Without dead ends: 0 [2018-10-02 11:49:28,195 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-02 11:49:28,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-02 11:49:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-02 11:49:28,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-02 11:49:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-02 11:49:28,196 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-02 11:49:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-02 11:49:28,196 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-02 11:49:28,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-02 11:49:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-02 11:49:28,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-02 11:49:28,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-02 11:49:28,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,221 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,243 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,269 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,271 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,313 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,316 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,328 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,333 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,338 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,351 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,362 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,378 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,379 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,406 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,424 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,447 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,472 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:28,559 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-02 11:49:29,387 WARN L178 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-02 11:49:29,878 WARN L178 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-02 11:49:30,274 WARN L178 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-02 11:49:30,375 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-02 11:49:30,592 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 11:49:30,694 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 11:49:31,101 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 11:49:31,288 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-02 11:49:31,428 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-02 11:49:31,530 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-02 11:49:31,531 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-02 11:49:31,531 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-02 11:49:31,531 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-02 11:49:31,531 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-02 11:49:31,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-02 11:49:31,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-02 11:49:31,532 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-02 11:49:31,532 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-02 11:49:31,532 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-02 11:49:31,532 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-02 11:49:31,532 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-02 11:49:31,533 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-02 11:49:31,533 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-02 11:49:31,533 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-02 11:49:31,533 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-02 11:49:31,533 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-02 11:49:31,533 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-02 11:49:31,533 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-02 11:49:31,533 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-02 11:49:31,534 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-02 11:49:31,534 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-02 11:49:31,534 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-02 11:49:31,552 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 02.10 11:49:31 BoogieIcfgContainer [2018-10-02 11:49:31,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-02 11:49:31,553 INFO L168 Benchmark]: Toolchain (without parser) took 14114.47 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 23.5 MB). Peak memory consumption was 595.6 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:31,555 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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-02 11:49:31,555 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.81 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-02 11:49:31,556 INFO L168 Benchmark]: Boogie Preprocessor took 68.78 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-02 11:49:31,556 INFO L168 Benchmark]: RCFGBuilder took 788.11 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-02 11:49:31,557 INFO L168 Benchmark]: TraceAbstraction took 13191.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -8.3 MB). Peak memory consumption was 563.9 MB. Max. memory is 7.1 GB. [2018-10-02 11:49:31,561 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.21 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 59.81 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 68.78 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 788.11 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 13191.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 130.0 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -8.3 MB). Peak memory consumption was 563.9 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.1s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 3.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s 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.4s 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, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s 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-02_11-49-31-581.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-02_11-49-31-581.csv Received shutdown request...