java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 09:15:47,078 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 09:15:47,080 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 09:15:47,091 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 09:15:47,091 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 09:15:47,092 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 09:15:47,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 09:15:47,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 09:15:47,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 09:15:47,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 09:15:47,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 09:15:47,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 09:15:47,100 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 09:15:47,101 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 09:15:47,102 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 09:15:47,103 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 09:15:47,104 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 09:15:47,106 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 09:15:47,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 09:15:47,109 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 09:15:47,110 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 09:15:47,111 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 09:15:47,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 09:15:47,114 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 09:15:47,115 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 09:15:47,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 09:15:47,117 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 09:15:47,117 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 09:15:47,118 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 09:15:47,120 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 09:15:47,120 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 09:15:47,121 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 09:15:47,121 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 09:15:47,121 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 09:15:47,122 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 09:15:47,123 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 09:15:47,123 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-10-03 09:15:47,138 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 09:15:47,139 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 09:15:47,140 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 09:15:47,140 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 09:15:47,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 09:15:47,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 09:15:47,141 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 09:15:47,141 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 09:15:47,141 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 09:15:47,141 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 09:15:47,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 09:15:47,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 09:15:47,142 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 09:15:47,142 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 09:15:47,142 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 09:15:47,143 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 09:15:47,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 09:15:47,143 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 09:15:47,143 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 09:15:47,143 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 09:15:47,144 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 09:15:47,144 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 09:15:47,144 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 09:15:47,144 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 09:15:47,144 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 09:15:47,145 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 09:15:47,145 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 09:15:47,145 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 09:15:47,145 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 09:15:47,145 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 09:15:47,146 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-10-03 09:15:47,206 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 09:15:47,218 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 09:15:47,222 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 09:15:47,224 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 09:15:47,224 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 09:15:47,225 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-03 09:15:47,225 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-03 09:15:47,316 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 09:15:47,319 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 09:15:47,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 09:15:47,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 09:15:47,320 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 09:15:47,340 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,355 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,362 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 09:15:47,363 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 09:15:47,363 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 09:15:47,364 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 09:15:47,375 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,375 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,379 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,380 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,389 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,392 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,394 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 03.10 09:15:47" (1/1) ... [2018-10-03 09:15:47,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 09:15:47,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 09:15:47,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 09:15:47,400 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 09:15:47,401 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 03.10 09:15:47" (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-03 09:15:47,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 09:15:47,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 09:15:48,165 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 09:15:48,166 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 03.10 09:15:48 BoogieIcfgContainer [2018-10-03 09:15:48,166 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 09:15:48,167 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 09:15:48,167 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 09:15:48,169 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 09:15:48,170 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 03.10 09:15:47" (1/2) ... [2018-10-03 09:15:48,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708bf0e1 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 09:15:48, skipping insertion in model container [2018-10-03 09:15:48,171 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 03.10 09:15:48" (2/2) ... [2018-10-03 09:15:48,173 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-03 09:15:48,182 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 09:15:48,191 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 09:15:48,240 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 09:15:48,241 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 09:15:48,241 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 09:15:48,241 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 09:15:48,241 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 09:15:48,241 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 09:15:48,241 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 09:15:48,242 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 09:15:48,242 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 09:15:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-03 09:15:48,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 09:15:48,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:48,265 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:48,266 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:48,275 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-03 09:15:48,279 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:48,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:48,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:48,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:48,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:48,554 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-03 09:15:48,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:48,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:48,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:48,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:48,575 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:48,577 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-03 09:15:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:48,921 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-03 09:15:48,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:48,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 09:15:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:48,937 INFO L225 Difference]: With dead ends: 56 [2018-10-03 09:15:48,937 INFO L226 Difference]: Without dead ends: 34 [2018-10-03 09:15:48,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-03 09:15:48,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-03 09:15:48,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-03 09:15:48,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-03 09:15:48,981 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-03 09:15:48,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:48,982 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-03 09:15:48,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-03 09:15:48,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-03 09:15:48,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:48,983 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 09:15:48,984 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:48,984 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:48,984 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-03 09:15:48,984 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:48,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:48,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:48,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:48,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:49,058 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-03 09:15:49,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:49,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:49,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:49,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:49,061 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:49,061 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-03 09:15:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:49,466 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-03 09:15:49,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:49,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-03 09:15:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:49,469 INFO L225 Difference]: With dead ends: 83 [2018-10-03 09:15:49,469 INFO L226 Difference]: Without dead ends: 50 [2018-10-03 09:15:49,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:49,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-03 09:15:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-03 09:15:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-03 09:15:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-03 09:15:49,497 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-03 09:15:49,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:49,497 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-03 09:15:49,497 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:49,498 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-03 09:15:49,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:15:49,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:49,500 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-03 09:15:49,502 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:49,502 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:49,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-03 09:15:49,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:49,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:49,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:49,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:49,639 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-03 09:15:49,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:49,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:49,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:49,640 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:49,641 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-03 09:15:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:49,860 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-03 09:15:49,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:49,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 09:15:49,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:49,862 INFO L225 Difference]: With dead ends: 106 [2018-10-03 09:15:49,862 INFO L226 Difference]: Without dead ends: 57 [2018-10-03 09:15:49,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:49,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-03 09:15:49,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-03 09:15:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-03 09:15:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-03 09:15:49,876 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-03 09:15:49,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:49,877 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-03 09:15:49,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:49,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-03 09:15:49,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 09:15:49,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:49,879 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-03 09:15:49,879 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:49,879 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:49,879 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-03 09:15:49,880 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:49,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:49,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:49,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:49,962 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-03 09:15:49,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:49,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:49,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:49,963 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:49,963 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-03 09:15:50,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:50,200 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-03 09:15:50,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:50,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 09:15:50,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:50,202 INFO L225 Difference]: With dead ends: 131 [2018-10-03 09:15:50,202 INFO L226 Difference]: Without dead ends: 74 [2018-10-03 09:15:50,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-03 09:15:50,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-03 09:15:50,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-03 09:15:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-03 09:15:50,218 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-03 09:15:50,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:50,218 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-03 09:15:50,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-03 09:15:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-03 09:15:50,220 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:50,220 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-03 09:15:50,220 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:50,220 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:50,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-03 09:15:50,221 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:50,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:50,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:50,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:50,316 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-03 09:15:50,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:50,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:50,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:50,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:50,319 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:50,319 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-03 09:15:50,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:50,497 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-03 09:15:50,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:50,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-03 09:15:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:50,499 INFO L225 Difference]: With dead ends: 153 [2018-10-03 09:15:50,499 INFO L226 Difference]: Without dead ends: 80 [2018-10-03 09:15:50,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:50,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-03 09:15:50,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-03 09:15:50,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-03 09:15:50,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-03 09:15:50,514 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-03 09:15:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:50,515 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-03 09:15:50,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-03 09:15:50,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 09:15:50,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:50,517 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-03 09:15:50,517 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:50,517 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:50,518 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-03 09:15:50,518 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:50,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:50,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:50,614 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-03 09:15:50,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:50,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:50,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:50,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:50,615 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:50,615 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-03 09:15:50,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:50,777 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-03 09:15:50,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:50,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-03 09:15:50,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:50,781 INFO L225 Difference]: With dead ends: 164 [2018-10-03 09:15:50,781 INFO L226 Difference]: Without dead ends: 85 [2018-10-03 09:15:50,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:50,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-03 09:15:50,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-03 09:15:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-03 09:15:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-03 09:15:50,798 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-03 09:15:50,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:50,798 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-03 09:15:50,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:50,799 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-03 09:15:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 09:15:50,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:50,801 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-03 09:15:50,801 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:50,801 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-03 09:15:50,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:50,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:50,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:50,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:50,816 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-03 09:15:50,816 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-03 09:15:50,816 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-03 09:15:50,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:50,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:50,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:15:51,152 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-03 09:15:51,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:51,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 09:15:51,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:51,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:51,187 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:51,188 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-03 09:15:51,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:51,359 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-03 09:15:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:51,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-03 09:15:51,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:51,361 INFO L225 Difference]: With dead ends: 246 [2018-10-03 09:15:51,362 INFO L226 Difference]: Without dead ends: 162 [2018-10-03 09:15:51,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 1 [2018-10-03 09:15:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-03 09:15:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-03 09:15:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-03 09:15:51,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-03 09:15:51,391 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-03 09:15:51,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:51,392 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-03 09:15:51,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:51,392 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-03 09:15:51,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-03 09:15:51,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:51,394 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-03 09:15:51,395 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:51,395 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-03 09:15:51,395 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:51,396 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:51,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:51,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:51,495 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-03 09:15:51,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:51,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:51,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:51,497 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:51,497 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-03 09:15:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:51,852 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-03 09:15:51,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:51,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-03 09:15:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:51,854 INFO L225 Difference]: With dead ends: 250 [2018-10-03 09:15:51,854 INFO L226 Difference]: Without dead ends: 166 [2018-10-03 09:15:51,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-03 09:15:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-03 09:15:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-03 09:15:51,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-03 09:15:51,883 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-03 09:15:51,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:51,883 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-03 09:15:51,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:51,884 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-03 09:15:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-03 09:15:51,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:51,886 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-03 09:15:51,886 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:51,886 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-03 09:15:51,887 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:51,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:51,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:52,093 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-03 09:15:52,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:15:52,095 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-03 09:15:52,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:52,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:15:52,845 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-03 09:15:52,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 09:15:52,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-03 09:15:52,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 09:15:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 09:15:52,867 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:52,867 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-03 09:15:54,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:54,420 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-03 09:15:54,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 09:15:54,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-03 09:15:54,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:54,424 INFO L225 Difference]: With dead ends: 598 [2018-10-03 09:15:54,424 INFO L226 Difference]: Without dead ends: 406 [2018-10-03 09:15:54,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s Time 0.2s impTime 6 [2018-10-03 09:15:54,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-03 09:15:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-03 09:15:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-03 09:15:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-03 09:15:54,465 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-03 09:15:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:54,466 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-03 09:15:54,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 09:15:54,466 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-03 09:15:54,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-03 09:15:54,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:54,468 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-03 09:15:54,469 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:54,469 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:54,469 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-03 09:15:54,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:54,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:54,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:54,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:54,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:54,560 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-03 09:15:54,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:54,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:54,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:54,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:54,561 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:54,561 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-03 09:15:54,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:54,721 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-03 09:15:54,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:54,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-03 09:15:54,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:54,723 INFO L225 Difference]: With dead ends: 399 [2018-10-03 09:15:54,724 INFO L226 Difference]: Without dead ends: 239 [2018-10-03 09:15:54,724 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:54,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-03 09:15:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-03 09:15:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-03 09:15:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-03 09:15:54,760 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-03 09:15:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:54,761 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-03 09:15:54,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:54,761 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-03 09:15:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-03 09:15:54,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:54,763 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-03 09:15:54,763 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:54,763 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-03 09:15:54,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:54,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:54,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:54,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:54,861 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-03 09:15:54,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:54,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:54,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:54,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:54,863 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:54,863 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-03 09:15:55,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:55,046 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-03 09:15:55,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:55,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-03 09:15:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:55,056 INFO L225 Difference]: With dead ends: 470 [2018-10-03 09:15:55,056 INFO L226 Difference]: Without dead ends: 237 [2018-10-03 09:15:55,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-03 09:15:55,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-03 09:15:55,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-03 09:15:55,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-03 09:15:55,093 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-03 09:15:55,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:55,093 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-03 09:15:55,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:55,094 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-03 09:15:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-03 09:15:55,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:55,095 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-03 09:15:55,095 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:55,095 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:55,096 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-03 09:15:55,096 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:55,096 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:55,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:55,197 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-03 09:15:55,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:55,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:55,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:55,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:55,198 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:55,199 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-03 09:15:55,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:55,370 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-03 09:15:55,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:55,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-03 09:15:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:55,373 INFO L225 Difference]: With dead ends: 465 [2018-10-03 09:15:55,373 INFO L226 Difference]: Without dead ends: 235 [2018-10-03 09:15:55,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:55,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-03 09:15:55,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-03 09:15:55,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-03 09:15:55,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-03 09:15:55,406 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-03 09:15:55,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:55,408 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-03 09:15:55,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:55,409 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-03 09:15:55,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-03 09:15:55,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:55,410 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-03 09:15:55,410 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:55,411 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:55,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-03 09:15:55,411 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:55,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:55,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:55,548 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-03 09:15:55,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:55,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:55,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:55,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:55,550 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:55,550 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-03 09:15:55,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:55,861 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-03 09:15:55,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:55,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-03 09:15:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:55,863 INFO L225 Difference]: With dead ends: 465 [2018-10-03 09:15:55,863 INFO L226 Difference]: Without dead ends: 238 [2018-10-03 09:15:55,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:55,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-03 09:15:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-03 09:15:55,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-03 09:15:55,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-03 09:15:55,891 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-03 09:15:55,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:55,892 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-03 09:15:55,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:55,892 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-03 09:15:55,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-03 09:15:55,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:55,893 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-03 09:15:55,893 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:55,893 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:55,893 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-03 09:15:55,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:55,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:55,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:55,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:56,020 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-03 09:15:56,021 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:56,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:56,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:56,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:56,022 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:56,022 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-03 09:15:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:56,555 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-03 09:15:56,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:56,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-03 09:15:56,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:56,557 INFO L225 Difference]: With dead ends: 498 [2018-10-03 09:15:56,557 INFO L226 Difference]: Without dead ends: 268 [2018-10-03 09:15:56,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:56,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-03 09:15:56,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-03 09:15:56,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-03 09:15:56,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-03 09:15:56,592 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-03 09:15:56,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:56,592 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-03 09:15:56,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-03 09:15:56,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-03 09:15:56,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:56,594 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-03 09:15:56,594 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:56,595 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-03 09:15:56,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:56,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:56,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:56,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:56,713 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-03 09:15:56,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:56,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:56,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:56,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:56,714 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:56,714 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-03 09:15:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:57,213 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-03 09:15:57,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:57,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-03 09:15:57,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:57,216 INFO L225 Difference]: With dead ends: 561 [2018-10-03 09:15:57,216 INFO L226 Difference]: Without dead ends: 301 [2018-10-03 09:15:57,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-03 09:15:57,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-03 09:15:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-03 09:15:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-03 09:15:57,252 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-03 09:15:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:57,252 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-03 09:15:57,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:57,252 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-03 09:15:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-03 09:15:57,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:57,254 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-03 09:15:57,254 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:57,254 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-03 09:15:57,255 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:57,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:57,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:57,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:57,379 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-03 09:15:57,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:57,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:57,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:57,381 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:57,381 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-03 09:15:57,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:57,646 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-03 09:15:57,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:57,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-03 09:15:57,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:57,649 INFO L225 Difference]: With dead ends: 397 [2018-10-03 09:15:57,649 INFO L226 Difference]: Without dead ends: 395 [2018-10-03 09:15:57,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-03 09:15:57,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-03 09:15:57,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-03 09:15:57,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-03 09:15:57,696 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-03 09:15:57,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:57,696 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-03 09:15:57,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:57,696 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-03 09:15:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 09:15:57,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:57,698 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-03 09:15:57,698 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:57,699 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-03 09:15:57,699 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:57,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:57,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:57,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:57,715 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-03 09:15:57,715 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-03 09:15:57,716 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) [2018-10-03 09:15:57,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-03 09:15:57,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:57,826 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:15:57,895 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-03 09:15:57,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 09:15:57,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 09:15:57,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 09:15:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 09:15:57,923 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:57,923 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-03 09:15:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:58,109 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-03 09:15:58,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 09:15:58,109 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-03 09:15:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:58,114 INFO L225 Difference]: With dead ends: 782 [2018-10-03 09:15:58,114 INFO L226 Difference]: Without dead ends: 395 [2018-10-03 09:15:58,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time 0.0s impTime 1 [2018-10-03 09:15:58,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-03 09:15:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-03 09:15:58,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-03 09:15:58,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-03 09:15:58,157 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-03 09:15:58,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:58,157 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-03 09:15:58,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 09:15:58,158 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-03 09:15:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-03 09:15:58,160 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 09:15:58,160 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-03 09:15:58,160 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 09:15:58,161 INFO L106 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-10-03 09:15:58,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-03 09:15:58,161 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 09:15:58,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 09:15:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:58,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:58,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 09:15:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:58,385 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-03 09:15:58,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 09:15:58,385 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-03 09:15:58,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 09:15:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 09:15:58,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 09:15:58,627 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-03 09:15:58,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 09:15:58,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 09:15:58,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 09:15:58,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 09:15:58,650 INFO L146 InterpolantAutomaton]: No coverage relation statistics for ImplicationMap [2018-10-03 09:15:58,650 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-03 09:15:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 09:15:58,972 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-03 09:15:58,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 09:15:58,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-03 09:15:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 09:15:58,973 INFO L225 Difference]: With dead ends: 629 [2018-10-03 09:15:58,973 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 09:15:58,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time 0.0s impTime 3 [2018-10-03 09:15:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 09:15:58,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 09:15:58,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 09:15:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 09:15:58,975 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-03 09:15:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 09:15:58,975 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 09:15:58,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 09:15:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 09:15:58,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 09:15:58,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 09:15:59,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,016 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,052 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,062 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,067 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,077 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,126 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,140 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,164 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,165 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,167 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,215 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,222 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,247 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,259 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,265 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,276 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,280 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,284 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,294 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,311 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,317 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,357 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,368 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,383 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,389 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,395 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:15:59,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 09:16:00,495 WARN L178 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-03 09:16:00,732 WARN L178 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-03 09:16:01,361 WARN L178 SmtUtils]: Spent 579.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-03 09:16:01,846 WARN L178 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 09:16:02,238 WARN L178 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 09:16:02,371 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-03 09:16:02,580 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 09:16:02,768 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 09:16:02,877 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-03 09:16:03,009 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 09:16:03,013 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-03 09:16:03,014 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-03 09:16:03,014 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-03 09:16:03,014 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-03 09:16:03,014 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-03 09:16:03,014 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-03 09:16:03,014 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-03 09:16:03,014 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-03 09:16:03,015 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-03 09:16:03,015 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-03 09:16:03,015 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-03 09:16:03,015 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-03 09:16:03,015 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-03 09:16:03,016 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-03 09:16:03,016 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-03 09:16:03,016 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-03 09:16:03,016 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-03 09:16:03,016 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-03 09:16:03,016 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-03 09:16:03,017 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-03 09:16:03,017 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-03 09:16:03,017 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-03 09:16:03,017 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-03 09:16:03,034 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 03.10 09:16:03 BoogieIcfgContainer [2018-10-03 09:16:03,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 09:16:03,035 INFO L168 Benchmark]: Toolchain (without parser) took 15718.25 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -2.9 MB). Peak memory consumption was 614.4 MB. Max. memory is 7.1 GB. [2018-10-03 09:16:03,036 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:16:03,037 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:16:03,037 INFO L168 Benchmark]: Boogie Preprocessor took 35.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-03 09:16:03,038 INFO L168 Benchmark]: RCFGBuilder took 766.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:16:03,039 INFO L168 Benchmark]: TraceAbstraction took 14867.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -34.6 MB). Peak memory consumption was 582.7 MB. Max. memory is 7.1 GB. [2018-10-03 09:16:03,043 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.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.81 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.64 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 766.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14867.49 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 165.7 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -34.6 MB). Peak memory consumption was 582.7 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, 14.7s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.3s AutomataDifference, 0.0s DeadEndRemovalTime, 4.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 461 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.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.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.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_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_09-16-03-061.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_09-16-03-061.csv Received shutdown request...