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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:09:00,318 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:09:00,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:09:00,332 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:09:00,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:09:00,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:09:00,334 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:09:00,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:09:00,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:09:00,338 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:09:00,339 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:09:00,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:09:00,341 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:09:00,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:09:00,343 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:09:00,344 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:09:00,345 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:09:00,346 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:09:00,348 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:09:00,350 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:09:00,351 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:09:00,352 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:09:00,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:09:00,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:09:00,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:09:00,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:09:00,363 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:09:00,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:09:00,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:09:00,369 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:09:00,369 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:09:00,370 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:09:00,370 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:09:00,371 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:09:00,372 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:09:00,372 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:09:00,373 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 15:09:00,382 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:09:00,383 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:09:00,385 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:09:00,386 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:09:00,386 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:09:00,386 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:09:00,387 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:09:00,387 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:09:00,387 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:09:00,388 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:09:00,388 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:09:00,388 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:09:00,388 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:09:00,389 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:09:00,389 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:09:00,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:09:00,469 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:09:00,473 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:09:00,475 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:09:00,475 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:09:00,476 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-15 15:09:00,476 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3.BV.c.cil.c_19.bpl' [2018-10-15 15:09:00,567 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:09:00,569 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 15:09:00,570 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:09:00,570 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:09:00,570 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:09:00,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,644 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,648 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,651 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/1) ... [2018-10-15 15:09:00,656 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:09:00,657 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:09:00,657 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:09:00,657 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:09:00,658 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (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:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:09:00,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:09:00,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:09:01,833 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:09:01,834 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:01 BoogieIcfgContainer [2018-10-15 15:09:01,834 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:09:01,837 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:09:01,837 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:09:01,842 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:09:01,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:09:00" (1/2) ... [2018-10-15 15:09:01,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4952f620 and model type s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:09:01, skipping insertion in model container [2018-10-15 15:09:01,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:09:01" (2/2) ... [2018-10-15 15:09:01,846 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3.BV.c.cil.c_19.bpl [2018-10-15 15:09:01,861 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:09:01,878 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:09:01,896 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:09:01,923 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:09:01,923 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:09:01,924 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:09:01,924 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:09:01,924 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:09:01,924 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:09:01,925 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:09:01,925 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:09:01,925 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:09:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states. [2018-10-15 15:09:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:09:01,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:01,974 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:01,976 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:01,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1145711235, now seen corresponding path program 1 times [2018-10-15 15:09:02,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:02,352 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-15 15:09:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:02,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:02,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:02,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:02,385 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 3 states. [2018-10-15 15:09:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:02,589 INFO L93 Difference]: Finished difference Result 390 states and 413 transitions. [2018-10-15 15:09:02,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:02,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-10-15 15:09:02,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:02,615 INFO L225 Difference]: With dead ends: 390 [2018-10-15 15:09:02,616 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 15:09:02,618 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-15 15:09:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 15:09:02,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 381. [2018-10-15 15:09:02,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-15 15:09:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 404 transitions. [2018-10-15 15:09:02,692 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 404 transitions. Word has length 169 [2018-10-15 15:09:02,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:02,694 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 404 transitions. [2018-10-15 15:09:02,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:02,695 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 404 transitions. [2018-10-15 15:09:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 15:09:02,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:02,701 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:02,702 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:02,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:02,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1472542508, now seen corresponding path program 1 times [2018-10-15 15:09:02,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:02,885 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-15 15:09:02,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:02,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:02,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:02,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:02,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:02,889 INFO L87 Difference]: Start difference. First operand 381 states and 404 transitions. Second operand 3 states. [2018-10-15 15:09:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:03,322 INFO L93 Difference]: Finished difference Result 398 states and 421 transitions. [2018-10-15 15:09:03,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:03,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-10-15 15:09:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:03,327 INFO L225 Difference]: With dead ends: 398 [2018-10-15 15:09:03,327 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 15:09:03,328 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-15 15:09:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 15:09:03,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-10-15 15:09:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 15:09:03,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 421 transitions. [2018-10-15 15:09:03,368 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 421 transitions. Word has length 193 [2018-10-15 15:09:03,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:03,369 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 421 transitions. [2018-10-15 15:09:03,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:03,369 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 421 transitions. [2018-10-15 15:09:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:09:03,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:03,374 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:03,374 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:03,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:03,375 INFO L82 PathProgramCache]: Analyzing trace with hash -404779128, now seen corresponding path program 1 times [2018-10-15 15:09:03,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-10-15 15:09:03,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:03,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:03,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:03,518 INFO L87 Difference]: Start difference. First operand 398 states and 421 transitions. Second operand 3 states. [2018-10-15 15:09:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:04,060 INFO L93 Difference]: Finished difference Result 417 states and 440 transitions. [2018-10-15 15:09:04,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:04,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-15 15:09:04,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:04,065 INFO L225 Difference]: With dead ends: 417 [2018-10-15 15:09:04,065 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 15:09:04,070 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-15 15:09:04,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 15:09:04,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2018-10-15 15:09:04,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-15 15:09:04,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 440 transitions. [2018-10-15 15:09:04,103 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 440 transitions. Word has length 219 [2018-10-15 15:09:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:04,104 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 440 transitions. [2018-10-15 15:09:04,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 440 transitions. [2018-10-15 15:09:04,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 15:09:04,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:04,115 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:04,116 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:04,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:04,116 INFO L82 PathProgramCache]: Analyzing trace with hash -323265035, now seen corresponding path program 1 times [2018-10-15 15:09:04,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:04,376 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-15 15:09:04,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:04,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:04,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:04,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:04,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:04,378 INFO L87 Difference]: Start difference. First operand 417 states and 440 transitions. Second operand 3 states. [2018-10-15 15:09:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:04,579 INFO L93 Difference]: Finished difference Result 459 states and 482 transitions. [2018-10-15 15:09:04,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:04,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-15 15:09:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:04,582 INFO L225 Difference]: With dead ends: 459 [2018-10-15 15:09:04,583 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 15:09:04,583 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-15 15:09:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 15:09:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 459. [2018-10-15 15:09:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-15 15:09:04,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 482 transitions. [2018-10-15 15:09:04,595 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 482 transitions. Word has length 242 [2018-10-15 15:09:04,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:04,596 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 482 transitions. [2018-10-15 15:09:04,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:04,597 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 482 transitions. [2018-10-15 15:09:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:09:04,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:04,602 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:04,602 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:04,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash -825743595, now seen corresponding path program 1 times [2018-10-15 15:09:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:04,828 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2018-10-15 15:09:04,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:04,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:04,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:04,831 INFO L87 Difference]: Start difference. First operand 459 states and 482 transitions. Second operand 3 states. [2018-10-15 15:09:05,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:05,316 INFO L93 Difference]: Finished difference Result 505 states and 528 transitions. [2018-10-15 15:09:05,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:05,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-10-15 15:09:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:05,319 INFO L225 Difference]: With dead ends: 505 [2018-10-15 15:09:05,319 INFO L226 Difference]: Without dead ends: 505 [2018-10-15 15:09:05,320 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-15 15:09:05,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-15 15:09:05,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2018-10-15 15:09:05,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-10-15 15:09:05,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 528 transitions. [2018-10-15 15:09:05,330 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 528 transitions. Word has length 273 [2018-10-15 15:09:05,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:05,331 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 528 transitions. [2018-10-15 15:09:05,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:05,331 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 528 transitions. [2018-10-15 15:09:05,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 15:09:05,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:05,333 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:05,334 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:05,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:05,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2092987787, now seen corresponding path program 1 times [2018-10-15 15:09:05,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:05,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-15 15:09:05,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:05,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:05,501 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:05,502 INFO L87 Difference]: Start difference. First operand 505 states and 528 transitions. Second operand 3 states. [2018-10-15 15:09:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:05,749 INFO L93 Difference]: Finished difference Result 559 states and 582 transitions. [2018-10-15 15:09:05,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:05,750 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-10-15 15:09:05,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:05,753 INFO L225 Difference]: With dead ends: 559 [2018-10-15 15:09:05,753 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 15:09:05,754 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-15 15:09:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 15:09:05,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2018-10-15 15:09:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2018-10-15 15:09:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 582 transitions. [2018-10-15 15:09:05,764 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 582 transitions. Word has length 307 [2018-10-15 15:09:05,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:05,765 INFO L481 AbstractCegarLoop]: Abstraction has 559 states and 582 transitions. [2018-10-15 15:09:05,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:05,765 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 582 transitions. [2018-10-15 15:09:05,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 15:09:05,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:05,768 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:05,768 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:05,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:05,769 INFO L82 PathProgramCache]: Analyzing trace with hash 250485107, now seen corresponding path program 1 times [2018-10-15 15:09:05,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:06,027 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 184 proven. 27 refuted. 0 times theorem prover too weak. 158 trivial. 0 not checked. [2018-10-15 15:09:06,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:09:06,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:09:06,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:09:06,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:09:06,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:09:06,031 INFO L87 Difference]: Start difference. First operand 559 states and 582 transitions. Second operand 4 states. [2018-10-15 15:09:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:06,842 INFO L93 Difference]: Finished difference Result 915 states and 959 transitions. [2018-10-15 15:09:06,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:09:06,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-10-15 15:09:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:06,849 INFO L225 Difference]: With dead ends: 915 [2018-10-15 15:09:06,849 INFO L226 Difference]: Without dead ends: 895 [2018-10-15 15:09:06,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-15 15:09:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2018-10-15 15:09:06,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 694. [2018-10-15 15:09:06,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-15 15:09:06,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 738 transitions. [2018-10-15 15:09:06,864 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 738 transitions. Word has length 336 [2018-10-15 15:09:06,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:06,865 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 738 transitions. [2018-10-15 15:09:06,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:09:06,865 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 738 transitions. [2018-10-15 15:09:06,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-15 15:09:06,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:06,868 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:06,869 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:06,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:06,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1467139458, now seen corresponding path program 1 times [2018-10-15 15:09:06,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:07,038 INFO L134 CoverageAnalysis]: Checked inductivity of 516 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2018-10-15 15:09:07,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:07,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:07,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:07,041 INFO L87 Difference]: Start difference. First operand 694 states and 738 transitions. Second operand 3 states. [2018-10-15 15:09:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:07,385 INFO L93 Difference]: Finished difference Result 784 states and 828 transitions. [2018-10-15 15:09:07,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:07,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2018-10-15 15:09:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:07,390 INFO L225 Difference]: With dead ends: 784 [2018-10-15 15:09:07,390 INFO L226 Difference]: Without dead ends: 784 [2018-10-15 15:09:07,390 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-15 15:09:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2018-10-15 15:09:07,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 784. [2018-10-15 15:09:07,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2018-10-15 15:09:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 828 transitions. [2018-10-15 15:09:07,406 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 828 transitions. Word has length 375 [2018-10-15 15:09:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:07,407 INFO L481 AbstractCegarLoop]: Abstraction has 784 states and 828 transitions. [2018-10-15 15:09:07,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:07,407 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 828 transitions. [2018-10-15 15:09:07,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-15 15:09:07,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:07,412 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:07,412 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:07,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:07,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1561164850, now seen corresponding path program 1 times [2018-10-15 15:09:07,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:07,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 516 trivial. 0 not checked. [2018-10-15 15:09:07,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:07,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:07,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:07,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:07,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:07,672 INFO L87 Difference]: Start difference. First operand 784 states and 828 transitions. Second operand 3 states. [2018-10-15 15:09:08,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:08,863 INFO L93 Difference]: Finished difference Result 880 states and 924 transitions. [2018-10-15 15:09:08,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:08,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2018-10-15 15:09:08,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:08,870 INFO L225 Difference]: With dead ends: 880 [2018-10-15 15:09:08,870 INFO L226 Difference]: Without dead ends: 880 [2018-10-15 15:09:08,871 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-15 15:09:08,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2018-10-15 15:09:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 880. [2018-10-15 15:09:08,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 880 states. [2018-10-15 15:09:08,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 924 transitions. [2018-10-15 15:09:08,891 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 924 transitions. Word has length 411 [2018-10-15 15:09:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:08,897 INFO L481 AbstractCegarLoop]: Abstraction has 880 states and 924 transitions. [2018-10-15 15:09:08,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 924 transitions. [2018-10-15 15:09:08,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 15:09:08,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:08,907 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 5, 5, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:08,907 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:08,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash -564754478, now seen corresponding path program 1 times [2018-10-15 15:09:08,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2018-10-15 15:09:09,138 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:09,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:09,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:09,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:09,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:09,140 INFO L87 Difference]: Start difference. First operand 880 states and 924 transitions. Second operand 3 states. [2018-10-15 15:09:10,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:10,411 INFO L93 Difference]: Finished difference Result 982 states and 1026 transitions. [2018-10-15 15:09:10,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:10,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 449 [2018-10-15 15:09:10,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:10,417 INFO L225 Difference]: With dead ends: 982 [2018-10-15 15:09:10,417 INFO L226 Difference]: Without dead ends: 982 [2018-10-15 15:09:10,417 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-15 15:09:10,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 982 states. [2018-10-15 15:09:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 982 to 982. [2018-10-15 15:09:10,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-10-15 15:09:10,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1026 transitions. [2018-10-15 15:09:10,435 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1026 transitions. Word has length 449 [2018-10-15 15:09:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:10,436 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1026 transitions. [2018-10-15 15:09:10,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:10,436 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1026 transitions. [2018-10-15 15:09:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 15:09:10,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:10,442 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 9, 8, 8, 7, 7, 6, 6, 6, 6, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:10,442 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:10,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:10,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1397738824, now seen corresponding path program 1 times [2018-10-15 15:09:10,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:10,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:10,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1145 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 902 trivial. 0 not checked. [2018-10-15 15:09:10,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:10,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:10,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:10,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:10,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:10,744 INFO L87 Difference]: Start difference. First operand 982 states and 1026 transitions. Second operand 3 states. [2018-10-15 15:09:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:11,344 INFO L93 Difference]: Finished difference Result 1090 states and 1134 transitions. [2018-10-15 15:09:11,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:11,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2018-10-15 15:09:11,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:11,353 INFO L225 Difference]: With dead ends: 1090 [2018-10-15 15:09:11,353 INFO L226 Difference]: Without dead ends: 1090 [2018-10-15 15:09:11,354 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-15 15:09:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2018-10-15 15:09:11,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1090. [2018-10-15 15:09:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1090 states. [2018-10-15 15:09:11,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1090 states to 1090 states and 1134 transitions. [2018-10-15 15:09:11,375 INFO L78 Accepts]: Start accepts. Automaton has 1090 states and 1134 transitions. Word has length 491 [2018-10-15 15:09:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:11,376 INFO L481 AbstractCegarLoop]: Abstraction has 1090 states and 1134 transitions. [2018-10-15 15:09:11,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1090 states and 1134 transitions. [2018-10-15 15:09:11,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2018-10-15 15:09:11,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:11,383 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:11,383 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:11,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:11,384 INFO L82 PathProgramCache]: Analyzing trace with hash -281574248, now seen corresponding path program 1 times [2018-10-15 15:09:11,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:11,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 884 trivial. 0 not checked. [2018-10-15 15:09:11,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:11,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:11,796 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:11,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:11,796 INFO L87 Difference]: Start difference. First operand 1090 states and 1134 transitions. Second operand 3 states. [2018-10-15 15:09:12,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:12,033 INFO L93 Difference]: Finished difference Result 1394 states and 1442 transitions. [2018-10-15 15:09:12,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:12,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 537 [2018-10-15 15:09:12,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:12,040 INFO L225 Difference]: With dead ends: 1394 [2018-10-15 15:09:12,040 INFO L226 Difference]: Without dead ends: 1385 [2018-10-15 15:09:12,041 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-15 15:09:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2018-10-15 15:09:12,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1385. [2018-10-15 15:09:12,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1385 states. [2018-10-15 15:09:12,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1433 transitions. [2018-10-15 15:09:12,062 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1433 transitions. Word has length 537 [2018-10-15 15:09:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:12,063 INFO L481 AbstractCegarLoop]: Abstraction has 1385 states and 1433 transitions. [2018-10-15 15:09:12,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1433 transitions. [2018-10-15 15:09:12,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 15:09:12,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:12,069 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 9, 9, 8, 8, 7, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:12,069 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:12,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:12,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1377004813, now seen corresponding path program 1 times [2018-10-15 15:09:12,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:09:12,314 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-15 15:09:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:09:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:09:12,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:09:12,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:09:12,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:09:12,316 INFO L87 Difference]: Start difference. First operand 1385 states and 1433 transitions. Second operand 3 states. [2018-10-15 15:09:12,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:09:12,573 INFO L93 Difference]: Finished difference Result 1740 states and 1807 transitions. [2018-10-15 15:09:12,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:09:12,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 538 [2018-10-15 15:09:12,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:09:12,580 INFO L225 Difference]: With dead ends: 1740 [2018-10-15 15:09:12,581 INFO L226 Difference]: Without dead ends: 1740 [2018-10-15 15:09:12,581 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-15 15:09:12,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2018-10-15 15:09:12,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1731. [2018-10-15 15:09:12,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2018-10-15 15:09:12,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 1798 transitions. [2018-10-15 15:09:12,610 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 1798 transitions. Word has length 538 [2018-10-15 15:09:12,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:09:12,611 INFO L481 AbstractCegarLoop]: Abstraction has 1731 states and 1798 transitions. [2018-10-15 15:09:12,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:09:12,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 1798 transitions. [2018-10-15 15:09:12,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 628 [2018-10-15 15:09:12,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:09:12,626 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 11, 11, 10, 10, 9, 9, 9, 9, 8, 7, 7, 6, 6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:09:12,626 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:09:12,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:09:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -764560138, now seen corresponding path program 1 times [2018-10-15 15:09:12,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:09:12,658 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-15 15:09:12,659 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-10-15 15:09:12,659 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 15:09:12,719 WARN L208 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-10-15 15:09:12,720 INFO L202 PluginConnector]: Adding new model s3_srvr_3.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:09:12 BoogieIcfgContainer [2018-10-15 15:09:12,720 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:09:12,723 INFO L168 Benchmark]: Toolchain (without parser) took 12152.73 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 329.8 MB). Peak memory consumption was 770.7 MB. Max. memory is 7.1 GB. [2018-10-15 15:09:12,725 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-15 15:09:12,726 INFO L168 Benchmark]: Boogie Preprocessor took 86.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:09:12,726 INFO L168 Benchmark]: RCFGBuilder took 1177.01 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:09:12,728 INFO L168 Benchmark]: TraceAbstraction took 10882.86 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 276.9 MB). Peak memory consumption was 717.8 MB. Max. memory is 7.1 GB. [2018-10-15 15:09:12,733 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 Preprocessor took 86.52 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1177.01 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: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10882.86 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 276.9 MB). Peak memory consumption was 717.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 480]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint, overapproximation of bitwiseAnd at line 329. Possible FailurePath: [L108] havoc main_#res; [L109] havoc main_#t~ret42, main_~s~208, main_~tmp~208; [L110] havoc main_~s~208; [L111] havoc main_~tmp~208; [L112] main_~s~208 := 8464; [L113] ssl3_accept_#in~initial_state := main_~s~208; [L114] havoc ssl3_accept_#res; [L115] havoc ssl3_accept_#t~nondet0, ssl3_accept_#t~nondet1, ssl3_accept_#t~nondet2, ssl3_accept_#t~nondet3, ssl3_accept_#t~nondet4, ssl3_accept_#t~nondet5, ssl3_accept_#t~nondet6, ssl3_accept_#t~nondet7, ssl3_accept_#t~nondet8, ssl3_accept_#t~nondet9, ssl3_accept_#t~nondet10, ssl3_accept_#t~nondet11, ssl3_accept_#t~nondet12, ssl3_accept_#t~nondet13, ssl3_accept_#t~nondet14, ssl3_accept_#t~nondet15, ssl3_accept_#t~nondet16, ssl3_accept_#t~nondet17, ssl3_accept_#t~nondet18, ssl3_accept_#t~nondet19, ssl3_accept_#t~nondet20, ssl3_accept_#t~nondet21, ssl3_accept_#t~nondet22, ssl3_accept_#t~nondet23, ssl3_accept_#t~nondet24, ssl3_accept_#t~nondet25, ssl3_accept_#t~nondet26, ssl3_accept_#t~nondet27, ssl3_accept_#t~nondet28, ssl3_accept_#t~nondet29, ssl3_accept_#t~nondet30, ssl3_accept_#t~nondet31, ssl3_accept_#t~nondet32, ssl3_accept_#t~nondet33, ssl3_accept_#t~nondet34, ssl3_accept_#t~nondet35, ssl3_accept_#t~nondet36, ssl3_accept_#t~nondet37, ssl3_accept_#t~nondet38, ssl3_accept_#t~nondet39, ssl3_accept_#t~nondet40, ssl3_accept_#t~nondet41, ssl3_accept_~initial_state, ssl3_accept_~s__info_callback~4, ssl3_accept_~s__in_handshake~4, ssl3_accept_~s__state~4, ssl3_accept_~s__new_session~4, ssl3_accept_~s__server~4, ssl3_accept_~s__version~4, ssl3_accept_~s__type~4, ssl3_accept_~s__init_num~4, ssl3_accept_~s__hit~4, ssl3_accept_~s__rwstate~4, ssl3_accept_~s__init_buf___0~4, ssl3_accept_~s__debug~4, ssl3_accept_~s__shutdown~4, ssl3_accept_~s__cert~4, ssl3_accept_~s__options~4, ssl3_accept_~s__verify_mode~4, ssl3_accept_~s__session__peer~4, ssl3_accept_~s__cert__pkeys__AT0__privatekey~4, ssl3_accept_~s__ctx__info_callback~4, ssl3_accept_~s__ctx__stats__sess_accept_renegotiate~4, ssl3_accept_~s__ctx__stats__sess_accept~4, ssl3_accept_~s__ctx__stats__sess_accept_good~4, ssl3_accept_~s__s3__tmp__cert_request~4, ssl3_accept_~s__s3__tmp__reuse_message~4, ssl3_accept_~s__s3__tmp__use_rsa_tmp~4, ssl3_accept_~s__s3__tmp__new_cipher~4, ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, ssl3_accept_~s__s3__tmp__next_state___0~4, ssl3_accept_~s__s3__tmp__new_cipher__algo_strength~4, ssl3_accept_~s__session__cipher~4, ssl3_accept_~buf~4, ssl3_accept_~l~4, ssl3_accept_~Time~4, ssl3_accept_~tmp~4, ssl3_accept_~cb~4, ssl3_accept_~num1~4, ssl3_accept_~ret~4, ssl3_accept_~new_state~4, ssl3_accept_~state~4, ssl3_accept_~skip~4, ssl3_accept_~got_new_session~4, ssl3_accept_~tmp___1~4, ssl3_accept_~tmp___2~4, ssl3_accept_~tmp___3~4, ssl3_accept_~tmp___4~4, ssl3_accept_~tmp___5~4, ssl3_accept_~tmp___6~4, ssl3_accept_~tmp___7~4, ssl3_accept_~tmp___8~4, ssl3_accept_~tmp___9~4, ssl3_accept_~tmp___10~4, ssl3_accept_~blastFlag~4, ssl3_accept_~__retres67~4; [L116] ssl3_accept_~initial_state := ssl3_accept_#in~initial_state; [L117] assume -2147483648 <= ssl3_accept_#t~nondet0 && ssl3_accept_#t~nondet0 <= 2147483647; [L118] ssl3_accept_~s__info_callback~4 := ssl3_accept_#t~nondet0; [L119] havoc ssl3_accept_#t~nondet0; [L120] assume -2147483648 <= ssl3_accept_#t~nondet1 && ssl3_accept_#t~nondet1 <= 2147483647; [L121] ssl3_accept_~s__in_handshake~4 := ssl3_accept_#t~nondet1; [L122] havoc ssl3_accept_#t~nondet1; [L123] havoc ssl3_accept_~s__state~4; [L124] havoc ssl3_accept_~s__new_session~4; [L125] havoc ssl3_accept_~s__server~4; [L126] assume -2147483648 <= ssl3_accept_#t~nondet2 && ssl3_accept_#t~nondet2 <= 2147483647; [L127] ssl3_accept_~s__version~4 := ssl3_accept_#t~nondet2; [L128] havoc ssl3_accept_#t~nondet2; [L129] havoc ssl3_accept_~s__type~4; [L130] havoc ssl3_accept_~s__init_num~4; [L131] assume -2147483648 <= ssl3_accept_#t~nondet3 && ssl3_accept_#t~nondet3 <= 2147483647; [L132] ssl3_accept_~s__hit~4 := ssl3_accept_#t~nondet3; [L133] havoc ssl3_accept_#t~nondet3; [L134] havoc ssl3_accept_~s__rwstate~4; [L135] havoc ssl3_accept_~s__init_buf___0~4; [L136] assume -2147483648 <= ssl3_accept_#t~nondet4 && ssl3_accept_#t~nondet4 <= 2147483647; [L137] ssl3_accept_~s__debug~4 := ssl3_accept_#t~nondet4; [L138] havoc ssl3_accept_#t~nondet4; [L139] havoc ssl3_accept_~s__shutdown~4; [L140] assume -2147483648 <= ssl3_accept_#t~nondet5 && ssl3_accept_#t~nondet5 <= 2147483647; [L141] ssl3_accept_~s__cert~4 := ssl3_accept_#t~nondet5; [L142] havoc ssl3_accept_#t~nondet5; [L143] assume -2147483648 <= ssl3_accept_#t~nondet6 && ssl3_accept_#t~nondet6 <= 2147483647; [L144] ssl3_accept_~s__options~4 := ssl3_accept_#t~nondet6; [L145] havoc ssl3_accept_#t~nondet6; [L146] assume -2147483648 <= ssl3_accept_#t~nondet7 && ssl3_accept_#t~nondet7 <= 2147483647; [L147] ssl3_accept_~s__verify_mode~4 := ssl3_accept_#t~nondet7; [L148] havoc ssl3_accept_#t~nondet7; [L149] assume -2147483648 <= ssl3_accept_#t~nondet8 && ssl3_accept_#t~nondet8 <= 2147483647; [L150] ssl3_accept_~s__session__peer~4 := ssl3_accept_#t~nondet8; [L151] havoc ssl3_accept_#t~nondet8; [L152] assume -2147483648 <= ssl3_accept_#t~nondet9 && ssl3_accept_#t~nondet9 <= 2147483647; [L153] ssl3_accept_~s__cert__pkeys__AT0__privatekey~4 := ssl3_accept_#t~nondet9; [L154] havoc ssl3_accept_#t~nondet9; [L155] assume -2147483648 <= ssl3_accept_#t~nondet10 && ssl3_accept_#t~nondet10 <= 2147483647; [L156] ssl3_accept_~s__ctx__info_callback~4 := ssl3_accept_#t~nondet10; [L157] havoc ssl3_accept_#t~nondet10; [L158] havoc ssl3_accept_~s__ctx__stats__sess_accept_renegotiate~4; [L159] havoc ssl3_accept_~s__ctx__stats__sess_accept~4; [L160] assume -2147483648 <= ssl3_accept_#t~nondet11 && ssl3_accept_#t~nondet11 <= 2147483647; [L161] ssl3_accept_~s__ctx__stats__sess_accept_good~4 := ssl3_accept_#t~nondet11; [L162] havoc ssl3_accept_#t~nondet11; [L163] havoc ssl3_accept_~s__s3__tmp__cert_request~4; [L164] assume -2147483648 <= ssl3_accept_#t~nondet12 && ssl3_accept_#t~nondet12 <= 2147483647; [L165] ssl3_accept_~s__s3__tmp__reuse_message~4 := ssl3_accept_#t~nondet12; [L166] havoc ssl3_accept_#t~nondet12; [L167] havoc ssl3_accept_~s__s3__tmp__use_rsa_tmp~4; [L168] assume -2147483648 <= ssl3_accept_#t~nondet13 && ssl3_accept_#t~nondet13 <= 2147483647; [L169] ssl3_accept_~s__s3__tmp__new_cipher~4 := ssl3_accept_#t~nondet13; [L170] havoc ssl3_accept_#t~nondet13; [L171] assume -2147483648 <= ssl3_accept_#t~nondet14 && ssl3_accept_#t~nondet14 <= 2147483647; [L172] ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4 := ssl3_accept_#t~nondet14; [L173] havoc ssl3_accept_#t~nondet14; [L174] havoc ssl3_accept_~s__s3__tmp__next_state___0~4; [L175] assume -2147483648 <= ssl3_accept_#t~nondet15 && ssl3_accept_#t~nondet15 <= 2147483647; [L176] ssl3_accept_~s__s3__tmp__new_cipher__algo_strength~4 := ssl3_accept_#t~nondet15; [L177] havoc ssl3_accept_#t~nondet15; [L178] havoc ssl3_accept_~s__session__cipher~4; [L179] havoc ssl3_accept_~buf~4; [L180] havoc ssl3_accept_~l~4; [L181] havoc ssl3_accept_~Time~4; [L182] havoc ssl3_accept_~tmp~4; [L183] havoc ssl3_accept_~cb~4; [L184] havoc ssl3_accept_~num1~4; [L185] havoc ssl3_accept_~ret~4; [L186] havoc ssl3_accept_~new_state~4; [L187] havoc ssl3_accept_~state~4; [L188] havoc ssl3_accept_~skip~4; [L189] havoc ssl3_accept_~got_new_session~4; [L190] assume -2147483648 <= ssl3_accept_#t~nondet16 && ssl3_accept_#t~nondet16 <= 2147483647; [L191] ssl3_accept_~tmp___1~4 := ssl3_accept_#t~nondet16; [L192] havoc ssl3_accept_#t~nondet16; [L193] assume -2147483648 <= ssl3_accept_#t~nondet17 && ssl3_accept_#t~nondet17 <= 2147483647; [L194] ssl3_accept_~tmp___2~4 := ssl3_accept_#t~nondet17; [L195] havoc ssl3_accept_#t~nondet17; [L196] assume -2147483648 <= ssl3_accept_#t~nondet18 && ssl3_accept_#t~nondet18 <= 2147483647; [L197] ssl3_accept_~tmp___3~4 := ssl3_accept_#t~nondet18; [L198] havoc ssl3_accept_#t~nondet18; [L199] assume -2147483648 <= ssl3_accept_#t~nondet19 && ssl3_accept_#t~nondet19 <= 2147483647; [L200] ssl3_accept_~tmp___4~4 := ssl3_accept_#t~nondet19; [L201] havoc ssl3_accept_#t~nondet19; [L202] assume -2147483648 <= ssl3_accept_#t~nondet20 && ssl3_accept_#t~nondet20 <= 2147483647; [L203] ssl3_accept_~tmp___5~4 := ssl3_accept_#t~nondet20; [L204] havoc ssl3_accept_#t~nondet20; [L205] assume -2147483648 <= ssl3_accept_#t~nondet21 && ssl3_accept_#t~nondet21 <= 2147483647; [L206] ssl3_accept_~tmp___6~4 := ssl3_accept_#t~nondet21; [L207] havoc ssl3_accept_#t~nondet21; [L208] havoc ssl3_accept_~tmp___7~4; [L209] assume -9223372036854775808 <= ssl3_accept_#t~nondet22 && ssl3_accept_#t~nondet22 <= 9223372036854775807; [L210] ssl3_accept_~tmp___8~4 := ssl3_accept_#t~nondet22; [L211] havoc ssl3_accept_#t~nondet22; [L212] assume -2147483648 <= ssl3_accept_#t~nondet23 && ssl3_accept_#t~nondet23 <= 2147483647; [L213] ssl3_accept_~tmp___9~4 := ssl3_accept_#t~nondet23; [L214] havoc ssl3_accept_#t~nondet23; [L215] assume -2147483648 <= ssl3_accept_#t~nondet24 && ssl3_accept_#t~nondet24 <= 2147483647; [L216] ssl3_accept_~tmp___10~4 := ssl3_accept_#t~nondet24; [L217] havoc ssl3_accept_#t~nondet24; [L218] havoc ssl3_accept_~blastFlag~4; [L219] havoc ssl3_accept_~__retres67~4; [L220] ssl3_accept_~s__state~4 := ssl3_accept_~initial_state; [L221] ssl3_accept_~blastFlag~4 := 0; [L222] assume -2147483648 <= ssl3_accept_#t~nondet25 && ssl3_accept_#t~nondet25 <= 2147483647; [L223] ssl3_accept_~tmp~4 := ssl3_accept_#t~nondet25; [L224] havoc ssl3_accept_#t~nondet25; [L225] ssl3_accept_~Time~4 := ssl3_accept_~tmp~4; [L226] ssl3_accept_~cb~4 := 0; [L227] ssl3_accept_~ret~4 := -1; [L228] ssl3_accept_~skip~4 := 0; [L229] ssl3_accept_~got_new_session~4 := 0; [L230] assume ssl3_accept_~s__info_callback~4 != 0; [L231] ssl3_accept_~cb~4 := ssl3_accept_~s__info_callback~4; [L232] ssl3_accept_~s__in_handshake~4 := ssl3_accept_~s__in_handshake~4 + 1; [L233] assume !(~bitwiseAnd(ssl3_accept_~tmp___1~4, 12288) != 0); [L234] assume !(ssl3_accept_~s__cert~4 == 0); [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L252] assume ssl3_accept_~s__state~4 == 8464; [L253] ssl3_accept_~s__shutdown~4 := 0; [L254] assume -2147483648 <= ssl3_accept_#t~nondet28 && ssl3_accept_#t~nondet28 <= 2147483647; [L255] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet28; [L256] havoc ssl3_accept_#t~nondet28; [L257] assume ssl3_accept_~blastFlag~4 == 0; [L258] ssl3_accept_~blastFlag~4 := 1; [L259] assume !(ssl3_accept_~ret~4 <= 0); [L260] ssl3_accept_~got_new_session~4 := 1; [L261] ssl3_accept_~s__state~4 := 8496; [L262] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L276] assume ssl3_accept_~s__state~4 == 8496; [L277] assume -2147483648 <= ssl3_accept_#t~nondet29 && ssl3_accept_#t~nondet29 <= 2147483647; [L278] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet29; [L279] havoc ssl3_accept_#t~nondet29; [L280] assume ssl3_accept_~blastFlag~4 == 1; [L281] ssl3_accept_~blastFlag~4 := 2; [L282] assume !(ssl3_accept_~ret~4 <= 0); [L283] assume !(ssl3_accept_~s__hit~4 != 0); [L284] ssl3_accept_~s__state~4 := 8512; [L285] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L294] assume ssl3_accept_~s__state~4 == 8512; [L295] assume ~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0; [L296] ssl3_accept_~skip~4 := 1; [L297] ssl3_accept_~s__state~4 := 8528; [L298] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L307] assume ssl3_accept_~s__state~4 == 8528; [L308] ssl3_accept_~l~4 := ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4; [L309] assume ~bitwiseAnd(ssl3_accept_~s__options~4, 2097152) % 18446744073709551616 != 0; [L310] ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 := 1; [L311] assume ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 != 0; [L312] assume -2147483648 <= ssl3_accept_#t~nondet31 && ssl3_accept_#t~nondet31 <= 2147483647; [L313] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet31; [L314] havoc ssl3_accept_#t~nondet31; [L315] assume !(ssl3_accept_~ret~4 <= 0); [L316] ssl3_accept_~s__state~4 := 8544; [L317] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L326] assume ssl3_accept_~s__state~4 == 8544; [L327] assume ~bitwiseAnd(ssl3_accept_~s__verify_mode~4, 1) != 0; [L328] assume !(ssl3_accept_~s__session__peer~4 != 0); [L329] assume !(~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0); [L330] ssl3_accept_~s__s3__tmp__cert_request~4 := 1; [L331] assume -2147483648 <= ssl3_accept_#t~nondet32 && ssl3_accept_#t~nondet32 <= 2147483647; [L332] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet32; [L333] havoc ssl3_accept_#t~nondet32; [L334] assume !(ssl3_accept_~ret~4 <= 0); [L335] ssl3_accept_~s__state~4 := 8448; [L336] ssl3_accept_~s__s3__tmp__next_state___0~4 := 8576; [L337] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L348] assume ssl3_accept_~s__state~4 == 8448; [L349] assume !(ssl3_accept_~num1~4 > 0); [L350] ssl3_accept_~s__state~4 := ssl3_accept_~s__s3__tmp__next_state___0~4; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L358] assume ssl3_accept_~s__state~4 == 8576; [L359] assume -2147483648 <= ssl3_accept_#t~nondet34 && ssl3_accept_#t~nondet34 <= 2147483647; [L360] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet34; [L361] havoc ssl3_accept_#t~nondet34; [L362] assume !(ssl3_accept_~ret~4 <= 0); [L363] assume !(ssl3_accept_~ret~4 == 2); [L364] assume -2147483648 <= ssl3_accept_#t~nondet35 && ssl3_accept_#t~nondet35 <= 2147483647; [L365] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet35; [L366] havoc ssl3_accept_#t~nondet35; [L367] assume !(ssl3_accept_~ret~4 <= 0); [L368] ssl3_accept_~s__init_num~4 := 0; [L369] ssl3_accept_~s__state~4 := 8592; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L378] assume ssl3_accept_~s__state~4 == 8592; [L379] assume -2147483648 <= ssl3_accept_#t~nondet36 && ssl3_accept_#t~nondet36 <= 2147483647; [L380] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet36; [L381] havoc ssl3_accept_#t~nondet36; [L382] assume !(ssl3_accept_~ret~4 <= 0); [L383] ssl3_accept_~s__state~4 := 8608; [L384] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L393] assume ssl3_accept_~s__state~4 == 8608; [L394] assume -2147483648 <= ssl3_accept_#t~nondet37 && ssl3_accept_#t~nondet37 <= 2147483647; [L395] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet37; [L396] havoc ssl3_accept_#t~nondet37; [L397] assume !(ssl3_accept_~ret~4 <= 0); [L398] ssl3_accept_~s__state~4 := 8640; [L399] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L408] assume ssl3_accept_~s__state~4 == 8640; [L409] assume -2147483648 <= ssl3_accept_#t~nondet38 && ssl3_accept_#t~nondet38 <= 2147483647; [L410] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet38; [L411] havoc ssl3_accept_#t~nondet38; [L424] assume !(ssl3_accept_~blastFlag~4 == 3); [L445] assume !(ssl3_accept_~ret~4 <= 0); [L446] assume !(ssl3_accept_~s__hit~4 != 0); [L447] ssl3_accept_~s__state~4 := 8656; [L448] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L414] assume !(ssl3_accept_~s__state~4 == 8640); [L415] assume !(ssl3_accept_~s__state~4 == 8641); [L429] assume ssl3_accept_~s__state~4 == 8656; [L430] ssl3_accept_~s__session__cipher~4 := ssl3_accept_~s__s3__tmp__new_cipher~4; [L431] assume !(ssl3_accept_~tmp___9~4 == 0); [L432] assume -2147483648 <= ssl3_accept_#t~nondet39 && ssl3_accept_#t~nondet39 <= 2147483647; [L433] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet39; [L434] havoc ssl3_accept_#t~nondet39; [L453] assume ssl3_accept_~blastFlag~4 == 2; [L454] ssl3_accept_~blastFlag~4 := 3; [L474] assume !(ssl3_accept_~ret~4 <= 0); [L475] ssl3_accept_~s__state~4 := 8672; [L476] ssl3_accept_~s__init_num~4 := 0; [L477] assume !(ssl3_accept_~tmp___10~4 == 0); [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L408] assume ssl3_accept_~s__state~4 == 8640; [L409] assume -2147483648 <= ssl3_accept_#t~nondet38 && ssl3_accept_#t~nondet38 <= 2147483647; [L410] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet38; [L411] havoc ssl3_accept_#t~nondet38; [L420] assume ssl3_accept_~blastFlag~4 == 3; [L421] ssl3_accept_~blastFlag~4 := ssl3_accept_~blastFlag~4 + (if ssl3_accept_~s__state~4 < 0 && ssl3_accept_~s__state~4 % ssl3_accept_~s__s3__tmp__next_state___0~4 != 0 then (if ssl3_accept_~s__s3__tmp__next_state___0~4 < 0 then ssl3_accept_~s__state~4 / ssl3_accept_~s__s3__tmp__next_state___0~4 - 1 else ssl3_accept_~s__state~4 / ssl3_accept_~s__s3__tmp__next_state___0~4 + 1) else ssl3_accept_~s__state~4 / ssl3_accept_~s__s3__tmp__next_state___0~4); [L445] assume !(ssl3_accept_~ret~4 <= 0); [L446] assume !(ssl3_accept_~s__hit~4 != 0); [L447] ssl3_accept_~s__state~4 := 8656; [L448] ssl3_accept_~s__init_num~4 := 0; [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L414] assume !(ssl3_accept_~s__state~4 == 8640); [L415] assume !(ssl3_accept_~s__state~4 == 8641); [L429] assume ssl3_accept_~s__state~4 == 8656; [L430] ssl3_accept_~s__session__cipher~4 := ssl3_accept_~s__s3__tmp__new_cipher~4; [L431] assume !(ssl3_accept_~tmp___9~4 == 0); [L432] assume -2147483648 <= ssl3_accept_#t~nondet39 && ssl3_accept_#t~nondet39 <= 2147483647; [L433] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet39; [L434] havoc ssl3_accept_#t~nondet39; [L457] assume !(ssl3_accept_~blastFlag~4 == 2); [L474] assume !(ssl3_accept_~ret~4 <= 0); [L475] ssl3_accept_~s__state~4 := 8672; [L476] ssl3_accept_~s__init_num~4 := 0; [L477] assume !(ssl3_accept_~tmp___10~4 == 0); [L270] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L271] ssl3_accept_~skip~4 := 0; [L237] assume true; [L238] assume !false; [L239] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L240] assume !(ssl3_accept_~s__state~4 == 12292); [L241] assume !(ssl3_accept_~s__state~4 == 16384); [L242] assume !(ssl3_accept_~s__state~4 == 8192); [L243] assume !(ssl3_accept_~s__state~4 == 24576); [L244] assume !(ssl3_accept_~s__state~4 == 8195); [L245] assume !(ssl3_accept_~s__state~4 == 8480); [L246] assume !(ssl3_accept_~s__state~4 == 8481); [L247] assume !(ssl3_accept_~s__state~4 == 8482); [L265] assume !(ssl3_accept_~s__state~4 == 8464); [L266] assume !(ssl3_accept_~s__state~4 == 8465); [L267] assume !(ssl3_accept_~s__state~4 == 8466); [L288] assume !(ssl3_accept_~s__state~4 == 8496); [L289] assume !(ssl3_accept_~s__state~4 == 8497); [L301] assume !(ssl3_accept_~s__state~4 == 8512); [L302] assume !(ssl3_accept_~s__state~4 == 8513); [L320] assume !(ssl3_accept_~s__state~4 == 8528); [L321] assume !(ssl3_accept_~s__state~4 == 8529); [L340] assume !(ssl3_accept_~s__state~4 == 8544); [L341] assume !(ssl3_accept_~s__state~4 == 8545); [L342] assume !(ssl3_accept_~s__state~4 == 8560); [L343] assume !(ssl3_accept_~s__state~4 == 8561); [L353] assume !(ssl3_accept_~s__state~4 == 8448); [L372] assume !(ssl3_accept_~s__state~4 == 8576); [L373] assume !(ssl3_accept_~s__state~4 == 8577); [L387] assume !(ssl3_accept_~s__state~4 == 8592); [L388] assume !(ssl3_accept_~s__state~4 == 8593); [L402] assume !(ssl3_accept_~s__state~4 == 8608); [L403] assume !(ssl3_accept_~s__state~4 == 8609); [L414] assume !(ssl3_accept_~s__state~4 == 8640); [L415] assume !(ssl3_accept_~s__state~4 == 8641); [L437] assume !(ssl3_accept_~s__state~4 == 8656); [L438] assume !(ssl3_accept_~s__state~4 == 8657); [L439] assume ssl3_accept_~s__state~4 == 8672; [L440] assume -2147483648 <= ssl3_accept_#t~nondet40 && ssl3_accept_#t~nondet40 <= 2147483647; [L441] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet40; [L442] havoc ssl3_accept_#t~nondet40; [L470] assume ssl3_accept_~blastFlag~4 == 4; [L471] assume !false; [L480] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 268 locations, 1 error locations. UNKNOWN Result, 10.8s OverallTime, 14 OverallIterations, 14 TraceHistogramMax, 6.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3863 SDtfs, 464 SDslu, 3120 SDs, 0 SdLazy, 960 SolverSat, 93 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1731occurred in iteration=13, 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.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 215 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4540 NumberOfCodeBlocks, 4540 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4527 ConstructedInterpolants, 0 QuantifiedInterpolants, 2402811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 6996/7023 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_15-09-12-751.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-09-12-751.csv Received shutdown request...