java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2eb0a67 [2018-10-03 08:49:07,137 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-03 08:49:07,139 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-03 08:49:07,151 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-03 08:49:07,151 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-03 08:49:07,152 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-03 08:49:07,153 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-03 08:49:07,155 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-03 08:49:07,157 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-03 08:49:07,157 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-03 08:49:07,158 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-03 08:49:07,159 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-03 08:49:07,160 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-03 08:49:07,161 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-03 08:49:07,162 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-03 08:49:07,163 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-03 08:49:07,166 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-03 08:49:07,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-03 08:49:07,176 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-03 08:49:07,181 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-03 08:49:07,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-03 08:49:07,185 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-03 08:49:07,189 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-03 08:49:07,190 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-03 08:49:07,190 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-03 08:49:07,191 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-03 08:49:07,193 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-03 08:49:07,193 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-03 08:49:07,194 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-03 08:49:07,197 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-03 08:49:07,197 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-03 08:49:07,198 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-03 08:49:07,198 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-03 08:49:07,198 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-03 08:49:07,199 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-03 08:49:07,201 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-03 08:49:07,201 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-10-03 08:49:07,230 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-03 08:49:07,230 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-03 08:49:07,231 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-03 08:49:07,231 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-10-03 08:49:07,232 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-03 08:49:07,232 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-03 08:49:07,232 INFO L133 SettingsManager]: * Use SBE=true [2018-10-03 08:49:07,233 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-03 08:49:07,233 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-03 08:49:07,233 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-03 08:49:07,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-03 08:49:07,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-03 08:49:07,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-03 08:49:07,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-03 08:49:07,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-03 08:49:07,235 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-03 08:49:07,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-03 08:49:07,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-03 08:49:07,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-03 08:49:07,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-03 08:49:07,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-03 08:49:07,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-03 08:49:07,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-03 08:49:07,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-03 08:49:07,238 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-03 08:49:07,238 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-03 08:49:07,238 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-03 08:49:07,238 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-03 08:49:07,238 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-03 08:49:07,239 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-03 08:49:07,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-03 08:49:07,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-03 08:49:07,318 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-03 08:49:07,320 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-03 08:49:07,321 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-03 08:49:07,321 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 08:49:07,322 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 08:49:07,405 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-03 08:49:07,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-03 08:49:07,410 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-03 08:49:07,410 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-03 08:49:07,410 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-03 08:49:07,430 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,457 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,466 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-03 08:49:07,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-03 08:49:07,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-03 08:49:07,467 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-03 08:49:07,478 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,479 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,491 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,492 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,506 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,509 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,511 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 08:49:07" (1/1) ... [2018-10-03 08:49:07,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-03 08:49:07,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-03 08:49:07,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-03 08:49:07,516 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-03 08:49:07,517 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 08:49:07" (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 08:49:07,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-03 08:49:07,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-03 08:49:08,281 INFO L340 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-03 08:49:08,282 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 08:49:08 BoogieIcfgContainer [2018-10-03 08:49:08,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-03 08:49:08,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-03 08:49:08,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-03 08:49:08,287 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-03 08:49:08,287 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 08:49:07" (1/2) ... [2018-10-03 08:49:08,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449a5523 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 08:49:08, skipping insertion in model container [2018-10-03 08:49:08,289 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 08:49:08" (2/2) ... [2018-10-03 08:49:08,291 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-03 08:49:08,301 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-03 08:49:08,310 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-03 08:49:08,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-03 08:49:08,363 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-10-03 08:49:08,363 INFO L382 AbstractCegarLoop]: Hoare is true [2018-10-03 08:49:08,363 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-03 08:49:08,364 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-03 08:49:08,364 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-03 08:49:08,364 INFO L386 AbstractCegarLoop]: Difference is false [2018-10-03 08:49:08,364 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-03 08:49:08,364 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-03 08:49:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-03 08:49:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-03 08:49:08,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:08,389 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-03 08:49:08,390 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:08,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:08,396 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-10-03 08:49:08,398 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:08,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:08,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:08,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:08,663 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 08:49:08,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:08,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:08,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:08,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:08,692 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-03 08:49:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:09,098 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-10-03 08:49:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:09,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-10-03 08:49:09,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:09,117 INFO L225 Difference]: With dead ends: 56 [2018-10-03 08:49:09,117 INFO L226 Difference]: Without dead ends: 34 [2018-10-03 08:49:09,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:09,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-03 08:49:09,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-10-03 08:49:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-03 08:49:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-10-03 08:49:09,177 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-10-03 08:49:09,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:09,181 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-10-03 08:49:09,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-10-03 08:49:09,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-03 08:49:09,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:09,185 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 08:49:09,185 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:09,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-10-03 08:49:09,186 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:09,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:09,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:09,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:09,337 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 08:49:09,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:09,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:09,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:09,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:09,341 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-10-03 08:49:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:09,553 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-10-03 08:49:09,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:09,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-03 08:49:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:09,555 INFO L225 Difference]: With dead ends: 83 [2018-10-03 08:49:09,556 INFO L226 Difference]: Without dead ends: 50 [2018-10-03 08:49:09,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:09,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-03 08:49:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-10-03 08:49:09,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-03 08:49:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-10-03 08:49:09,571 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-10-03 08:49:09,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:09,573 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-10-03 08:49:09,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-10-03 08:49:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 08:49:09,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:09,575 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 08:49:09,575 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:09,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-10-03 08:49:09,576 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:09,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:09,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:09,666 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 08:49:09,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:09,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:09,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:09,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:09,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:09,669 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-10-03 08:49:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:09,919 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-10-03 08:49:09,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:09,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 08:49:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:09,921 INFO L225 Difference]: With dead ends: 106 [2018-10-03 08:49:09,922 INFO L226 Difference]: Without dead ends: 57 [2018-10-03 08:49:09,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:09,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-03 08:49:09,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-10-03 08:49:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-03 08:49:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-10-03 08:49:09,945 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-10-03 08:49:09,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:09,945 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-10-03 08:49:09,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-10-03 08:49:09,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-03 08:49:09,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:09,948 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 08:49:09,949 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:09,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:09,949 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-10-03 08:49:09,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:09,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:09,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:09,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:09,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:10,033 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 08:49:10,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:10,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:10,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:10,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:10,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:10,035 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-10-03 08:49:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:10,342 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-10-03 08:49:10,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:10,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-03 08:49:10,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:10,345 INFO L225 Difference]: With dead ends: 131 [2018-10-03 08:49:10,348 INFO L226 Difference]: Without dead ends: 74 [2018-10-03 08:49:10,349 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:10,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-03 08:49:10,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-10-03 08:49:10,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-03 08:49:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-10-03 08:49:10,371 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-10-03 08:49:10,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:10,372 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-10-03 08:49:10,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-10-03 08:49:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-03 08:49:10,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:10,375 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 08:49:10,376 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:10,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:10,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-10-03 08:49:10,376 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:10,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:10,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:10,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:10,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:10,478 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 08:49:10,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:10,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:10,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:10,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:10,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:10,480 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-10-03 08:49:10,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:10,727 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-10-03 08:49:10,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:10,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-10-03 08:49:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:10,729 INFO L225 Difference]: With dead ends: 153 [2018-10-03 08:49:10,729 INFO L226 Difference]: Without dead ends: 80 [2018-10-03 08:49:10,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-03 08:49:10,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-10-03 08:49:10,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-03 08:49:10,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-10-03 08:49:10,745 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-10-03 08:49:10,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:10,746 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-10-03 08:49:10,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:10,746 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-10-03 08:49:10,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-03 08:49:10,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:10,748 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 08:49:10,748 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:10,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:10,749 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-10-03 08:49:10,749 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:10,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:10,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:10,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:10,837 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 08:49:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:10,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:10,839 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-10-03 08:49:11,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:11,027 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-10-03 08:49:11,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:11,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-10-03 08:49:11,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:11,030 INFO L225 Difference]: With dead ends: 164 [2018-10-03 08:49:11,030 INFO L226 Difference]: Without dead ends: 85 [2018-10-03 08:49:11,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-03 08:49:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-10-03 08:49:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-03 08:49:11,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-10-03 08:49:11,051 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-10-03 08:49:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:11,052 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-10-03 08:49:11,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:11,052 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-10-03 08:49:11,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-03 08:49:11,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:11,054 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 08:49:11,054 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:11,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:11,055 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-10-03 08:49:11,055 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:11,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:11,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:11,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,068 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-03 08:49:11,069 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-03 08:49:11,069 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 08:49:11,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:11,150 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:49:11,217 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 08:49:11,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:11,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-03 08:49:11,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:11,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:11,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:11,254 INFO L87 Difference]: Start difference. First operand 85 states and 127 transitions. Second operand 3 states. [2018-10-03 08:49:11,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:11,481 INFO L93 Difference]: Finished difference Result 246 states and 370 transitions. [2018-10-03 08:49:11,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:11,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2018-10-03 08:49:11,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:11,483 INFO L225 Difference]: With dead ends: 246 [2018-10-03 08:49:11,484 INFO L226 Difference]: Without dead ends: 162 [2018-10-03 08:49:11,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-03 08:49:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-10-03 08:49:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-03 08:49:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2018-10-03 08:49:11,513 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 44 [2018-10-03 08:49:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:11,516 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2018-10-03 08:49:11,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:11,516 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2018-10-03 08:49:11,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-03 08:49:11,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:11,520 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 08:49:11,521 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:11,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash -688187521, now seen corresponding path program 1 times [2018-10-03 08:49:11,521 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:11,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:11,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:11,626 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 08:49:11,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:11,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:11,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:11,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:11,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:11,629 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 3 states. [2018-10-03 08:49:11,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:11,862 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2018-10-03 08:49:11,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:11,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2018-10-03 08:49:11,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:11,865 INFO L225 Difference]: With dead ends: 250 [2018-10-03 08:49:11,865 INFO L226 Difference]: Without dead ends: 166 [2018-10-03 08:49:11,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:11,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-03 08:49:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-10-03 08:49:11,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-03 08:49:11,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 238 transitions. [2018-10-03 08:49:11,890 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 238 transitions. Word has length 47 [2018-10-03 08:49:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:11,890 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 238 transitions. [2018-10-03 08:49:11,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 238 transitions. [2018-10-03 08:49:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-03 08:49:11,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:11,892 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 08:49:11,893 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:11,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:11,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1326956629, now seen corresponding path program 1 times [2018-10-03 08:49:11,893 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:11,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:11,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:11,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:12,058 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 08:49:12,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:49:12,058 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 08:49:12,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:12,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:12,143 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:49:12,216 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 08:49:12,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-03 08:49:12,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2018-10-03 08:49:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-03 08:49:12,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-03 08:49:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:49:12,238 INFO L87 Difference]: Start difference. First operand 166 states and 238 transitions. Second operand 5 states. [2018-10-03 08:49:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:13,644 INFO L93 Difference]: Finished difference Result 598 states and 860 transitions. [2018-10-03 08:49:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-03 08:49:13,645 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-10-03 08:49:13,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:13,649 INFO L225 Difference]: With dead ends: 598 [2018-10-03 08:49:13,649 INFO L226 Difference]: Without dead ends: 406 [2018-10-03 08:49:13,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-03 08:49:13,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-10-03 08:49:13,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 240. [2018-10-03 08:49:13,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-03 08:49:13,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 333 transitions. [2018-10-03 08:49:13,699 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 333 transitions. Word has length 48 [2018-10-03 08:49:13,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:13,699 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 333 transitions. [2018-10-03 08:49:13,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-03 08:49:13,699 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 333 transitions. [2018-10-03 08:49:13,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-03 08:49:13,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:13,701 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 08:49:13,702 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:13,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:13,702 INFO L82 PathProgramCache]: Analyzing trace with hash 2115677753, now seen corresponding path program 1 times [2018-10-03 08:49:13,702 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:13,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:13,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:13,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:13,790 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 08:49:13,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:13,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:13,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:13,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:13,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:13,792 INFO L87 Difference]: Start difference. First operand 240 states and 333 transitions. Second operand 3 states. [2018-10-03 08:49:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:13,931 INFO L93 Difference]: Finished difference Result 399 states and 560 transitions. [2018-10-03 08:49:13,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:13,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-10-03 08:49:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:13,933 INFO L225 Difference]: With dead ends: 399 [2018-10-03 08:49:13,933 INFO L226 Difference]: Without dead ends: 239 [2018-10-03 08:49:13,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-03 08:49:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-10-03 08:49:13,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-03 08:49:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 329 transitions. [2018-10-03 08:49:13,970 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 329 transitions. Word has length 60 [2018-10-03 08:49:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:13,970 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 329 transitions. [2018-10-03 08:49:13,970 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 329 transitions. [2018-10-03 08:49:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-03 08:49:13,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:13,972 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 08:49:13,972 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:13,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 227864519, now seen corresponding path program 1 times [2018-10-03 08:49:13,973 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:13,973 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:13,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:13,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:14,059 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 08:49:14,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:14,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:14,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:14,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:14,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,061 INFO L87 Difference]: Start difference. First operand 239 states and 329 transitions. Second operand 3 states. [2018-10-03 08:49:14,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:14,193 INFO L93 Difference]: Finished difference Result 470 states and 649 transitions. [2018-10-03 08:49:14,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:14,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-10-03 08:49:14,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:14,196 INFO L225 Difference]: With dead ends: 470 [2018-10-03 08:49:14,196 INFO L226 Difference]: Without dead ends: 237 [2018-10-03 08:49:14,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-03 08:49:14,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-10-03 08:49:14,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-03 08:49:14,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 319 transitions. [2018-10-03 08:49:14,227 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 319 transitions. Word has length 65 [2018-10-03 08:49:14,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:14,228 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 319 transitions. [2018-10-03 08:49:14,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:14,228 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 319 transitions. [2018-10-03 08:49:14,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-03 08:49:14,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:14,229 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 08:49:14,229 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:14,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:14,230 INFO L82 PathProgramCache]: Analyzing trace with hash -242141821, now seen corresponding path program 1 times [2018-10-03 08:49:14,230 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:14,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:14,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:14,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:14,309 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 08:49:14,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:14,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:14,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:14,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:14,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,311 INFO L87 Difference]: Start difference. First operand 237 states and 319 transitions. Second operand 3 states. [2018-10-03 08:49:14,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:14,436 INFO L93 Difference]: Finished difference Result 465 states and 628 transitions. [2018-10-03 08:49:14,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:14,437 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2018-10-03 08:49:14,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:14,439 INFO L225 Difference]: With dead ends: 465 [2018-10-03 08:49:14,439 INFO L226 Difference]: Without dead ends: 235 [2018-10-03 08:49:14,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-03 08:49:14,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-10-03 08:49:14,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-03 08:49:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 309 transitions. [2018-10-03 08:49:14,473 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 309 transitions. Word has length 71 [2018-10-03 08:49:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:14,473 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 309 transitions. [2018-10-03 08:49:14,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 309 transitions. [2018-10-03 08:49:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-03 08:49:14,474 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:14,475 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 08:49:14,475 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:14,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:14,475 INFO L82 PathProgramCache]: Analyzing trace with hash -1274982729, now seen corresponding path program 1 times [2018-10-03 08:49:14,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:14,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:14,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:14,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:14,570 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 08:49:14,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:14,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:14,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:14,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:14,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,572 INFO L87 Difference]: Start difference. First operand 235 states and 309 transitions. Second operand 3 states. [2018-10-03 08:49:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:14,958 INFO L93 Difference]: Finished difference Result 465 states and 615 transitions. [2018-10-03 08:49:14,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:14,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2018-10-03 08:49:14,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:14,960 INFO L225 Difference]: With dead ends: 465 [2018-10-03 08:49:14,960 INFO L226 Difference]: Without dead ends: 238 [2018-10-03 08:49:14,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:14,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-03 08:49:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-10-03 08:49:14,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-03 08:49:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 307 transitions. [2018-10-03 08:49:14,990 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 307 transitions. Word has length 78 [2018-10-03 08:49:14,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:14,990 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 307 transitions. [2018-10-03 08:49:14,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 307 transitions. [2018-10-03 08:49:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-03 08:49:14,992 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:14,992 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 08:49:14,992 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:14,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:14,993 INFO L82 PathProgramCache]: Analyzing trace with hash 409856557, now seen corresponding path program 1 times [2018-10-03 08:49:14,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:14,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:14,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:14,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:15,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:15,092 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 08:49:15,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:15,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:15,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:15,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:15,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:15,094 INFO L87 Difference]: Start difference. First operand 238 states and 307 transitions. Second operand 3 states. [2018-10-03 08:49:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:15,618 INFO L93 Difference]: Finished difference Result 498 states and 646 transitions. [2018-10-03 08:49:15,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:15,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2018-10-03 08:49:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:15,620 INFO L225 Difference]: With dead ends: 498 [2018-10-03 08:49:15,621 INFO L226 Difference]: Without dead ends: 268 [2018-10-03 08:49:15,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:15,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-03 08:49:15,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-10-03 08:49:15,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-03 08:49:15,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 337 transitions. [2018-10-03 08:49:15,650 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 337 transitions. Word has length 86 [2018-10-03 08:49:15,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:15,650 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 337 transitions. [2018-10-03 08:49:15,650 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:15,650 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 337 transitions. [2018-10-03 08:49:15,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-03 08:49:15,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:15,651 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 08:49:15,652 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:15,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:15,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1980925187, now seen corresponding path program 1 times [2018-10-03 08:49:15,652 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:15,652 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:15,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:15,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:15,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:15,731 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 08:49:15,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:15,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:15,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:15,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:15,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:15,733 INFO L87 Difference]: Start difference. First operand 268 states and 337 transitions. Second operand 3 states. [2018-10-03 08:49:15,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:15,875 INFO L93 Difference]: Finished difference Result 561 states and 712 transitions. [2018-10-03 08:49:15,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:15,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2018-10-03 08:49:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:15,877 INFO L225 Difference]: With dead ends: 561 [2018-10-03 08:49:15,877 INFO L226 Difference]: Without dead ends: 301 [2018-10-03 08:49:15,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:15,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-03 08:49:15,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-10-03 08:49:15,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-03 08:49:15,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 370 transitions. [2018-10-03 08:49:15,914 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 370 transitions. Word has length 96 [2018-10-03 08:49:15,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:15,915 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 370 transitions. [2018-10-03 08:49:15,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:15,915 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 370 transitions. [2018-10-03 08:49:15,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-03 08:49:15,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:15,916 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 08:49:15,917 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:15,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:15,917 INFO L82 PathProgramCache]: Analyzing trace with hash -93746115, now seen corresponding path program 1 times [2018-10-03 08:49:15,917 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:15,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:15,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:15,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:15,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:16,044 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 08:49:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:16,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:16,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:16,046 INFO L87 Difference]: Start difference. First operand 301 states and 370 transitions. Second operand 3 states. [2018-10-03 08:49:16,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:16,309 INFO L93 Difference]: Finished difference Result 397 states and 491 transitions. [2018-10-03 08:49:16,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:16,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 107 [2018-10-03 08:49:16,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:16,312 INFO L225 Difference]: With dead ends: 397 [2018-10-03 08:49:16,312 INFO L226 Difference]: Without dead ends: 395 [2018-10-03 08:49:16,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-03 08:49:16,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-03 08:49:16,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-03 08:49:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 489 transitions. [2018-10-03 08:49:16,368 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 489 transitions. Word has length 107 [2018-10-03 08:49:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:16,368 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 489 transitions. [2018-10-03 08:49:16,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 489 transitions. [2018-10-03 08:49:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-03 08:49:16,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:16,371 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 08:49:16,371 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:16,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:16,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1780977529, now seen corresponding path program 1 times [2018-10-03 08:49:16,372 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:16,372 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:16,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:16,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:16,390 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-03 08:49:16,391 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-10-03 08:49:16,391 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-10-03 08:49:16,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:16,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:49:16,560 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 08:49:16,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-03 08:49:16,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-03 08:49:16,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-03 08:49:16,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-03 08:49:16,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:16,593 INFO L87 Difference]: Start difference. First operand 395 states and 489 transitions. Second operand 3 states. [2018-10-03 08:49:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:16,984 INFO L93 Difference]: Finished difference Result 782 states and 969 transitions. [2018-10-03 08:49:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-03 08:49:16,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2018-10-03 08:49:16,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:16,987 INFO L225 Difference]: With dead ends: 782 [2018-10-03 08:49:16,987 INFO L226 Difference]: Without dead ends: 395 [2018-10-03 08:49:16,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-03 08:49:16,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-03 08:49:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 395. [2018-10-03 08:49:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-03 08:49:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 466 transitions. [2018-10-03 08:49:17,031 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 466 transitions. Word has length 136 [2018-10-03 08:49:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:17,032 INFO L480 AbstractCegarLoop]: Abstraction has 395 states and 466 transitions. [2018-10-03 08:49:17,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-03 08:49:17,032 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 466 transitions. [2018-10-03 08:49:17,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-03 08:49:17,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-03 08:49:17,034 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 08:49:17,035 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-03 08:49:17,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-03 08:49:17,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1988836963, now seen corresponding path program 1 times [2018-10-03 08:49:17,035 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-03 08:49:17,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-03 08:49:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:17,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-03 08:49:17,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-03 08:49:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:17,211 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 08:49:17,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-03 08:49:17,211 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-03 08:49:17,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-03 08:49:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-03 08:49:17,350 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-03 08:49:17,398 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 08:49:17,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-03 08:49:17,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-10-03 08:49:17,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-03 08:49:17,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-03 08:49:17,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-03 08:49:17,437 INFO L87 Difference]: Start difference. First operand 395 states and 466 transitions. Second operand 4 states. [2018-10-03 08:49:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-03 08:49:18,006 INFO L93 Difference]: Finished difference Result 629 states and 744 transitions. [2018-10-03 08:49:18,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-03 08:49:18,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 188 [2018-10-03 08:49:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-03 08:49:18,007 INFO L225 Difference]: With dead ends: 629 [2018-10-03 08:49:18,007 INFO L226 Difference]: Without dead ends: 0 [2018-10-03 08:49:18,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-03 08:49:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-03 08:49:18,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-03 08:49:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-03 08:49:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-03 08:49:18,009 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 188 [2018-10-03 08:49:18,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-03 08:49:18,010 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-03 08:49:18,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-03 08:49:18,010 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-03 08:49:18,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-03 08:49:18,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-03 08:49:18,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,044 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,086 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,100 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,109 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,132 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,135 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,150 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,151 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,188 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,198 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,211 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,213 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,218 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,219 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,239 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,241 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,278 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,314 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,315 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,323 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,329 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,335 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,370 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,387 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,450 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,456 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,464 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,487 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,488 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:18,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-10-03 08:49:19,101 WARN L178 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 23 [2018-10-03 08:49:19,729 WARN L178 SmtUtils]: Spent 625.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2018-10-03 08:49:20,286 WARN L178 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 29 [2018-10-03 08:49:20,401 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 27 [2018-10-03 08:49:20,628 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 08:49:20,734 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 08:49:21,151 WARN L178 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 08:49:21,431 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 28 [2018-10-03 08:49:21,699 WARN L178 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 08:49:21,808 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 26 [2018-10-03 08:49:21,950 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 23 [2018-10-03 08:49:21,954 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 08:49:21,954 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 08:49:21,955 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 08:49:21,955 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 08:49:21,955 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 08:49:21,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 3 485) no Hoare annotation was computed. [2018-10-03 08:49:21,955 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 3 485) no Hoare annotation was computed. [2018-10-03 08:49:21,956 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 08:49:21,956 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 08:49:21,956 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 08:49:21,956 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 08:49:21,957 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 484) no Hoare annotation was computed. [2018-10-03 08:49:21,957 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 08:49:21,957 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 3 485) no Hoare annotation was computed. [2018-10-03 08:49:21,957 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 08:49:21,957 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 08:49:21,958 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 08:49:21,958 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 08:49:21,958 INFO L421 ceAbstractionStarter]: At program point L476(lines 476 483) the Hoare annotation is: false [2018-10-03 08:49:21,958 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 08:49:21,958 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 08:49:21,958 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 08:49:21,958 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 08:49:21,977 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 08:49:21 BoogieIcfgContainer [2018-10-03 08:49:21,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-03 08:49:21,978 INFO L168 Benchmark]: Toolchain (without parser) took 14572.62 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 174.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -30.4 MB). Peak memory consumption was 615.6 MB. Max. memory is 7.1 GB. [2018-10-03 08:49:21,979 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 08:49:21,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.33 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 08:49:21,980 INFO L168 Benchmark]: Boogie Preprocessor took 48.94 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 08:49:21,981 INFO L168 Benchmark]: RCFGBuilder took 766.70 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 08:49:21,982 INFO L168 Benchmark]: TraceAbstraction took 13693.84 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 174.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -62.1 MB). Peak memory consumption was 583.9 MB. Max. memory is 7.1 GB. [2018-10-03 08:49:21,986 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.20 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 56.33 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 48.94 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.70 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 13693.84 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 174.6 MB). Free memory was 1.4 GB in the beginning and 1.5 GB in the end (delta: -62.1 MB). Peak memory consumption was 583.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 484]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) - InvariantResult [Line: 459]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 3) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 323]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || (((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 355]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 408]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 426]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 236]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 264]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 439]: Loop Invariant Derived loop invariant: ((((!(8672 == ssl3_accept_~s__state~4) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 416]: Loop Invariant Derived loop invariant: (((((!(8656 == ssl3_accept_~s__state~4) && !(8672 == ssl3_accept_~s__state~4)) && ssl3_accept_~blastFlag~4 <= 2) && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4) - InvariantResult [Line: 447]: Loop Invariant Derived loop invariant: 8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3 - InvariantResult [Line: 476]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: ((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || (((((!(8512 == ssl3_accept_~s__state~4) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) && ssl3_accept_~s__state~4 <= 8576) && !(8448 == ssl3_accept_~s__state~4))) || ((((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8544 == ssl3_accept_~s__state~4)) && !(8528 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4)) - InvariantResult [Line: 291]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: ((((8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~blastFlag~4 <= 2 && !(8512 == ssl3_accept_~s__state~4)) && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448) - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: ((((ssl3_accept_~blastFlag~4 <= 2 && ssl3_accept_~s__s3__tmp__next_state___0~4 <= 8576) || (8672 <= ssl3_accept_~s__state~4 && ssl3_accept_~blastFlag~4 <= 3)) || (ssl3_accept_~blastFlag~4 <= 2 && !(8448 == ssl3_accept_~s__state~4))) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 == 8448)) || ((ssl3_accept_~s__s3__tmp__next_state___0~4 <= 3 && ssl3_accept_~blastFlag~4 <= 3) && ssl3_accept_~s__state~4 <= 3) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. SAFE Result, 13.6s OverallTime, 18 OverallIterations, 19 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 3.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 463 SDtfs, 165 SDslu, 184 SDs, 0 SdLazy, 673 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=395occurred in iteration=16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 166 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 19 LocationsWithAnnotation, 19 PreInvPairs, 288 NumberOfFragments, 732 HoareAnnotationTreeSize, 19 FomulaSimplifications, 12030 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 19 FomulaSimplificationsInter, 1541 FormulaSimplificationTreeSizeReductionInter, 3.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1437 NumberOfCodeBlocks, 1437 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1417 ConstructedInterpolants, 0 QuantifiedInterpolants, 184792 SizeOfPredicates, 3 NumberOfNonLiveVariables, 2058 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 20 InterpolantComputations, 17 PerfectInterpolantSequences, 5056/5080 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-10-03_08-49-22-004.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-03_08-49-22-004.csv Received shutdown request...