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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:34:53,442 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:34:53,445 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:34:53,456 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:34:53,457 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:34:53,458 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:34:53,459 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:34:53,461 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:34:53,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:34:53,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:34:53,464 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:34:53,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:34:53,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:34:53,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:34:53,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:34:53,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:34:53,469 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:34:53,471 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:34:53,473 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:34:53,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:34:53,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:34:53,476 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:34:53,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:34:53,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:34:53,479 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:34:53,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:34:53,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:34:53,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:34:53,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:34:53,485 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:34:53,485 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:34:53,486 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:34:53,486 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:34:53,486 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:34:53,488 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:34:53,489 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:34:53,489 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:34:53,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:34:53,508 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:34:53,509 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:34:53,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:34:53,510 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:34:53,512 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:34:53,513 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:34:53,513 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:34:53,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:34:53,514 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:34:53,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:34:53,514 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:34:53,514 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:34:53,515 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:34:53,515 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:34:53,580 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:34:53,596 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:34:53,599 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:34:53,601 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:34:53,602 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:34:53,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-10-15 15:34:53,603 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-10-15 15:34:53,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:34:53,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:34:53,721 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:34:53,721 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:34:53,721 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:34:53,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/1) ... [2018-10-15 15:34:53,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:34:53,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:34:53,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:34:53,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:34:53,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (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:34:53,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:34:53,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:34:55,087 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:34:55,088 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:55 BoogieIcfgContainer [2018-10-15 15:34:55,088 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:34:55,089 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:34:55,089 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:34:55,090 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:34:55,094 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:55" (1/1) ... [2018-10-15 15:34:55,099 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:34:55,127 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:55 BasicIcfg [2018-10-15 15:34:55,128 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:34:55,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:34:55,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:34:55,132 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:34:55,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:34:53" (1/3) ... [2018-10-15 15:34:55,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45deb1d and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:34:55, skipping insertion in model container [2018-10-15 15:34:55,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:34:55" (2/3) ... [2018-10-15 15:34:55,134 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45deb1d and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:34:55, skipping insertion in model container [2018-10-15 15:34:55,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:34:55" (3/3) ... [2018-10-15 15:34:55,136 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bplleft_unchanged_by_heapseparator [2018-10-15 15:34:55,147 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:34:55,156 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:34:55,174 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:34:55,204 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:34:55,205 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:34:55,205 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:34:55,205 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:34:55,205 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:34:55,205 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:34:55,206 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:34:55,206 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:34:55,206 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:34:55,235 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states. [2018-10-15 15:34:55,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:34:55,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:55,267 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:34:55,269 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:55,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:55,275 INFO L82 PathProgramCache]: Analyzing trace with hash 561252035, now seen corresponding path program 1 times [2018-10-15 15:34:55,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:55,637 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:34:55,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:55,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:55,646 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:55,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:55,666 INFO L87 Difference]: Start difference. First operand 271 states. Second operand 3 states. [2018-10-15 15:34:55,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:55,888 INFO L93 Difference]: Finished difference Result 396 states and 419 transitions. [2018-10-15 15:34:55,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:55,892 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2018-10-15 15:34:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:55,915 INFO L225 Difference]: With dead ends: 396 [2018-10-15 15:34:55,915 INFO L226 Difference]: Without dead ends: 392 [2018-10-15 15:34:55,917 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:34:55,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-15 15:34:55,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 387. [2018-10-15 15:34:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-15 15:34:55,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 410 transitions. [2018-10-15 15:34:55,993 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 410 transitions. Word has length 169 [2018-10-15 15:34:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:55,995 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 410 transitions. [2018-10-15 15:34:55,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:55,995 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 410 transitions. [2018-10-15 15:34:56,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 15:34:56,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:56,001 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:34:56,002 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:56,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 9505634, now seen corresponding path program 1 times [2018-10-15 15:34:56,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:56,193 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:34:56,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:56,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:56,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:56,197 INFO L87 Difference]: Start difference. First operand 387 states and 410 transitions. Second operand 3 states. [2018-10-15 15:34:56,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:56,580 INFO L93 Difference]: Finished difference Result 404 states and 427 transitions. [2018-10-15 15:34:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:56,581 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 193 [2018-10-15 15:34:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:56,592 INFO L225 Difference]: With dead ends: 404 [2018-10-15 15:34:56,592 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 15:34:56,594 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:34:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 15:34:56,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-10-15 15:34:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-15 15:34:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 427 transitions. [2018-10-15 15:34:56,633 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 427 transitions. Word has length 193 [2018-10-15 15:34:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:56,634 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 427 transitions. [2018-10-15 15:34:56,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 427 transitions. [2018-10-15 15:34:56,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 15:34:56,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:56,642 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:34:56,642 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:56,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:56,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1293655751, now seen corresponding path program 1 times [2018-10-15 15:34:56,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:56,880 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:34:56,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:56,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:56,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:56,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:56,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:56,884 INFO L87 Difference]: Start difference. First operand 404 states and 427 transitions. Second operand 3 states. [2018-10-15 15:34:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:57,099 INFO L93 Difference]: Finished difference Result 423 states and 446 transitions. [2018-10-15 15:34:57,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:57,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 219 [2018-10-15 15:34:57,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:57,106 INFO L225 Difference]: With dead ends: 423 [2018-10-15 15:34:57,106 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 15:34:57,106 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:34:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 15:34:57,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 423. [2018-10-15 15:34:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-15 15:34:57,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 446 transitions. [2018-10-15 15:34:57,135 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 446 transitions. Word has length 219 [2018-10-15 15:34:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:57,136 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 446 transitions. [2018-10-15 15:34:57,137 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:57,137 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 446 transitions. [2018-10-15 15:34:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 15:34:57,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:57,144 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:34:57,145 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:57,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:57,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1669650172, now seen corresponding path program 1 times [2018-10-15 15:34:57,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:57,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:57,356 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:34:57,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:57,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:57,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:57,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:57,358 INFO L87 Difference]: Start difference. First operand 423 states and 446 transitions. Second operand 3 states. [2018-10-15 15:34:57,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:57,599 INFO L93 Difference]: Finished difference Result 465 states and 488 transitions. [2018-10-15 15:34:57,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:57,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 242 [2018-10-15 15:34:57,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:57,603 INFO L225 Difference]: With dead ends: 465 [2018-10-15 15:34:57,603 INFO L226 Difference]: Without dead ends: 465 [2018-10-15 15:34:57,604 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:34:57,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-15 15:34:57,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2018-10-15 15:34:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-15 15:34:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 488 transitions. [2018-10-15 15:34:57,616 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 488 transitions. Word has length 242 [2018-10-15 15:34:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:57,617 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 488 transitions. [2018-10-15 15:34:57,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 488 transitions. [2018-10-15 15:34:57,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-15 15:34:57,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:57,622 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:34:57,622 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:57,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 329658202, now seen corresponding path program 1 times [2018-10-15 15:34:57,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:57,805 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:34:57,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:57,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:57,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:57,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:57,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:57,807 INFO L87 Difference]: Start difference. First operand 465 states and 488 transitions. Second operand 3 states. [2018-10-15 15:34:58,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:58,146 INFO L93 Difference]: Finished difference Result 511 states and 534 transitions. [2018-10-15 15:34:58,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:58,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2018-10-15 15:34:58,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:58,149 INFO L225 Difference]: With dead ends: 511 [2018-10-15 15:34:58,149 INFO L226 Difference]: Without dead ends: 511 [2018-10-15 15:34:58,150 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:34:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2018-10-15 15:34:58,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 511. [2018-10-15 15:34:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 15:34:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 534 transitions. [2018-10-15 15:34:58,159 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 534 transitions. Word has length 273 [2018-10-15 15:34:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:58,160 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 534 transitions. [2018-10-15 15:34:58,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:58,160 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 534 transitions. [2018-10-15 15:34:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 15:34:58,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:58,165 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:34:58,165 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:58,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:58,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1619607504, now seen corresponding path program 1 times [2018-10-15 15:34:58,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:58,320 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:34:58,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:58,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:58,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:58,321 INFO L87 Difference]: Start difference. First operand 511 states and 534 transitions. Second operand 3 states. [2018-10-15 15:34:58,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:58,756 INFO L93 Difference]: Finished difference Result 565 states and 588 transitions. [2018-10-15 15:34:58,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:34:58,757 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2018-10-15 15:34:58,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:58,759 INFO L225 Difference]: With dead ends: 565 [2018-10-15 15:34:58,760 INFO L226 Difference]: Without dead ends: 565 [2018-10-15 15:34:58,760 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:34:58,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2018-10-15 15:34:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2018-10-15 15:34:58,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-15 15:34:58,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 588 transitions. [2018-10-15 15:34:58,769 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 588 transitions. Word has length 307 [2018-10-15 15:34:58,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:58,770 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 588 transitions. [2018-10-15 15:34:58,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:34:58,770 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 588 transitions. [2018-10-15 15:34:58,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 15:34:58,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:58,773 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:34:58,773 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:58,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:58,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1815983061, now seen corresponding path program 1 times [2018-10-15 15:34:58,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:58,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:59,014 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:34:59,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:34:59,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 15:34:59,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 15:34:59,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 15:34:59,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 15:34:59,017 INFO L87 Difference]: Start difference. First operand 565 states and 588 transitions. Second operand 4 states. [2018-10-15 15:34:59,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:34:59,760 INFO L93 Difference]: Finished difference Result 1017 states and 1074 transitions. [2018-10-15 15:34:59,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 15:34:59,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-10-15 15:34:59,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:34:59,766 INFO L225 Difference]: With dead ends: 1017 [2018-10-15 15:34:59,766 INFO L226 Difference]: Without dead ends: 997 [2018-10-15 15:34:59,767 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:34:59,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-10-15 15:34:59,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 769. [2018-10-15 15:34:59,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-10-15 15:34:59,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 826 transitions. [2018-10-15 15:34:59,784 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 826 transitions. Word has length 336 [2018-10-15 15:34:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:34:59,784 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 826 transitions. [2018-10-15 15:34:59,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 15:34:59,785 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 826 transitions. [2018-10-15 15:34:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-15 15:34:59,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:34:59,788 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:34:59,789 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:34:59,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:34:59,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1663052084, now seen corresponding path program 1 times [2018-10-15 15:34:59,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:34:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:34:59,971 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:34:59,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:34:59,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:34:59,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:34:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:34:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:34:59,973 INFO L87 Difference]: Start difference. First operand 769 states and 826 transitions. Second operand 3 states. [2018-10-15 15:35:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:00,820 INFO L93 Difference]: Finished difference Result 889 states and 946 transitions. [2018-10-15 15:35:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:00,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 375 [2018-10-15 15:35:00,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:00,825 INFO L225 Difference]: With dead ends: 889 [2018-10-15 15:35:00,825 INFO L226 Difference]: Without dead ends: 889 [2018-10-15 15:35:00,826 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:35:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-10-15 15:35:00,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2018-10-15 15:35:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-10-15 15:35:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 946 transitions. [2018-10-15 15:35:00,846 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 946 transitions. Word has length 375 [2018-10-15 15:35:00,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:00,847 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 946 transitions. [2018-10-15 15:35:00,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 946 transitions. [2018-10-15 15:35:00,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-10-15 15:35:00,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:00,852 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:35:00,852 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:00,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:00,852 INFO L82 PathProgramCache]: Analyzing trace with hash 2009027591, now seen corresponding path program 1 times [2018-10-15 15:35:00,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,120 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:35:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:01,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:01,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:01,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:01,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:01,122 INFO L87 Difference]: Start difference. First operand 889 states and 946 transitions. Second operand 3 states. [2018-10-15 15:35:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:01,349 INFO L93 Difference]: Finished difference Result 907 states and 941 transitions. [2018-10-15 15:35:01,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:01,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 411 [2018-10-15 15:35:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:01,354 INFO L225 Difference]: With dead ends: 907 [2018-10-15 15:35:01,354 INFO L226 Difference]: Without dead ends: 907 [2018-10-15 15:35:01,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:35:01,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2018-10-15 15:35:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 749. [2018-10-15 15:35:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2018-10-15 15:35:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 783 transitions. [2018-10-15 15:35:01,369 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 783 transitions. Word has length 411 [2018-10-15 15:35:01,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:01,370 INFO L481 AbstractCegarLoop]: Abstraction has 749 states and 783 transitions. [2018-10-15 15:35:01,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:01,370 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 783 transitions. [2018-10-15 15:35:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-15 15:35:01,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:01,374 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, 1, 1, 1] [2018-10-15 15:35:01,374 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:01,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:01,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1123618765, now seen corresponding path program 1 times [2018-10-15 15:35:01,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:01,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:01,579 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:35:01,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:01,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:01,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:01,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:01,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:01,582 INFO L87 Difference]: Start difference. First operand 749 states and 783 transitions. Second operand 3 states. [2018-10-15 15:35:01,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:01,828 INFO L93 Difference]: Finished difference Result 817 states and 851 transitions. [2018-10-15 15:35:01,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:01,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 452 [2018-10-15 15:35:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:01,833 INFO L225 Difference]: With dead ends: 817 [2018-10-15 15:35:01,833 INFO L226 Difference]: Without dead ends: 817 [2018-10-15 15:35:01,833 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:35:01,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 817 states. [2018-10-15 15:35:01,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 817 to 817. [2018-10-15 15:35:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2018-10-15 15:35:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 851 transitions. [2018-10-15 15:35:01,846 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 851 transitions. Word has length 452 [2018-10-15 15:35:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:01,847 INFO L481 AbstractCegarLoop]: Abstraction has 817 states and 851 transitions. [2018-10-15 15:35:01,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 851 transitions. [2018-10-15 15:35:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-10-15 15:35:01,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:01,851 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, 1, 1, 1] [2018-10-15 15:35:01,851 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:01,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:01,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1303048125, now seen corresponding path program 1 times [2018-10-15 15:35:01,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:01,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:02,131 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:35:02,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:02,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:02,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:02,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:02,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:02,133 INFO L87 Difference]: Start difference. First operand 817 states and 851 transitions. Second operand 3 states. [2018-10-15 15:35:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:03,180 INFO L93 Difference]: Finished difference Result 889 states and 923 transitions. [2018-10-15 15:35:03,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:03,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 494 [2018-10-15 15:35:03,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:03,185 INFO L225 Difference]: With dead ends: 889 [2018-10-15 15:35:03,185 INFO L226 Difference]: Without dead ends: 889 [2018-10-15 15:35:03,186 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:35:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2018-10-15 15:35:03,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 889. [2018-10-15 15:35:03,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2018-10-15 15:35:03,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 923 transitions. [2018-10-15 15:35:03,201 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 923 transitions. Word has length 494 [2018-10-15 15:35:03,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:03,202 INFO L481 AbstractCegarLoop]: Abstraction has 889 states and 923 transitions. [2018-10-15 15:35:03,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 923 transitions. [2018-10-15 15:35:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2018-10-15 15:35:03,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:03,207 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, 1, 1] [2018-10-15 15:35:03,208 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:03,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:03,208 INFO L82 PathProgramCache]: Analyzing trace with hash -502644625, now seen corresponding path program 1 times [2018-10-15 15:35:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:03,598 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:35:03,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:03,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:03,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:03,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:03,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:03,600 INFO L87 Difference]: Start difference. First operand 889 states and 923 transitions. Second operand 3 states. [2018-10-15 15:35:03,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:03,876 INFO L93 Difference]: Finished difference Result 1196 states and 1234 transitions. [2018-10-15 15:35:03,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:03,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 540 [2018-10-15 15:35:03,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:03,882 INFO L225 Difference]: With dead ends: 1196 [2018-10-15 15:35:03,882 INFO L226 Difference]: Without dead ends: 1187 [2018-10-15 15:35:03,882 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:35:03,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2018-10-15 15:35:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1187. [2018-10-15 15:35:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2018-10-15 15:35:03,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1225 transitions. [2018-10-15 15:35:03,901 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1225 transitions. Word has length 540 [2018-10-15 15:35:03,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:03,901 INFO L481 AbstractCegarLoop]: Abstraction has 1187 states and 1225 transitions. [2018-10-15 15:35:03,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1225 transitions. [2018-10-15 15:35:03,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 15:35:03,906 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:03,907 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, 1, 1, 1] [2018-10-15 15:35:03,907 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:03,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:03,907 INFO L82 PathProgramCache]: Analyzing trace with hash -106581241, now seen corresponding path program 1 times [2018-10-15 15:35:03,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:35:04,255 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:35:04,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:35:04,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:35:04,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:35:04,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:35:04,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:35:04,257 INFO L87 Difference]: Start difference. First operand 1187 states and 1225 transitions. Second operand 3 states. [2018-10-15 15:35:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:35:04,541 INFO L93 Difference]: Finished difference Result 1547 states and 1604 transitions. [2018-10-15 15:35:04,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:35:04,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 541 [2018-10-15 15:35:04,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:35:04,551 INFO L225 Difference]: With dead ends: 1547 [2018-10-15 15:35:04,552 INFO L226 Difference]: Without dead ends: 1547 [2018-10-15 15:35:04,552 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:35:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2018-10-15 15:35:04,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1538. [2018-10-15 15:35:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2018-10-15 15:35:04,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 1595 transitions. [2018-10-15 15:35:04,582 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 1595 transitions. Word has length 541 [2018-10-15 15:35:04,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:35:04,583 INFO L481 AbstractCegarLoop]: Abstraction has 1538 states and 1595 transitions. [2018-10-15 15:35:04,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:35:04,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 1595 transitions. [2018-10-15 15:35:04,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-15 15:35:04,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:35:04,592 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, 1, 1, 1] [2018-10-15 15:35:04,593 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:35:04,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:35:04,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1375193384, now seen corresponding path program 1 times [2018-10-15 15:35:04,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:35:04,624 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-10-15 15:35:04,624 INFO L285 seRefinementStrategy]: Strategy FixedRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-10-15 15:35:04,624 INFO L442 BasicCegarLoop]: Counterexample might be feasible [2018-10-15 15:35:04,690 WARN L208 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-10-15 15:35:04,690 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:35:04 BasicIcfg [2018-10-15 15:35:04,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 15:35:04,692 INFO L168 Benchmark]: Toolchain (without parser) took 10972.19 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.5 GB in the beginning and 1.1 GB in the end (delta: 399.2 MB). Peak memory consumption was 840.1 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:04,694 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:04,694 INFO L168 Benchmark]: Boogie Preprocessor took 84.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 15:35:04,695 INFO L168 Benchmark]: RCFGBuilder took 1280.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:04,696 INFO L168 Benchmark]: IcfgTransformer took 38.72 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:35:04,696 INFO L168 Benchmark]: TraceAbstraction took 9562.06 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: 346.3 MB). Peak memory consumption was 787.3 MB. Max. memory is 7.1 GB. [2018-10-15 15:35:04,702 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 84.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1280.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * IcfgTransformer took 38.72 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. * TraceAbstraction took 9562.06 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: 346.3 MB). Peak memory consumption was 787.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 484]: 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 330. Possible FailurePath: [L109] havoc main_#res; [L110] havoc main_#t~ret43, main_~s~208, main_~tmp~208; [L111] havoc main_~s~208; [L112] havoc main_~tmp~208; [L113] main_~s~208 := 8464; [L114] ssl3_accept_#in~initial_state := main_~s~208; [L115] havoc ssl3_accept_#res; [L116] 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_#t~nondet42, 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; [L117] ssl3_accept_~initial_state := ssl3_accept_#in~initial_state; [L118] assume -2147483648 <= ssl3_accept_#t~nondet0 && ssl3_accept_#t~nondet0 <= 2147483647; [L119] ssl3_accept_~s__info_callback~4 := ssl3_accept_#t~nondet0; [L120] havoc ssl3_accept_#t~nondet0; [L121] assume -2147483648 <= ssl3_accept_#t~nondet1 && ssl3_accept_#t~nondet1 <= 2147483647; [L122] ssl3_accept_~s__in_handshake~4 := ssl3_accept_#t~nondet1; [L123] havoc ssl3_accept_#t~nondet1; [L124] havoc ssl3_accept_~s__state~4; [L125] havoc ssl3_accept_~s__new_session~4; [L126] havoc ssl3_accept_~s__server~4; [L127] assume -2147483648 <= ssl3_accept_#t~nondet2 && ssl3_accept_#t~nondet2 <= 2147483647; [L128] ssl3_accept_~s__version~4 := ssl3_accept_#t~nondet2; [L129] havoc ssl3_accept_#t~nondet2; [L130] havoc ssl3_accept_~s__type~4; [L131] havoc ssl3_accept_~s__init_num~4; [L132] assume -2147483648 <= ssl3_accept_#t~nondet3 && ssl3_accept_#t~nondet3 <= 2147483647; [L133] ssl3_accept_~s__hit~4 := ssl3_accept_#t~nondet3; [L134] havoc ssl3_accept_#t~nondet3; [L135] havoc ssl3_accept_~s__rwstate~4; [L136] havoc ssl3_accept_~s__init_buf___0~4; [L137] assume -2147483648 <= ssl3_accept_#t~nondet4 && ssl3_accept_#t~nondet4 <= 2147483647; [L138] ssl3_accept_~s__debug~4 := ssl3_accept_#t~nondet4; [L139] havoc ssl3_accept_#t~nondet4; [L140] havoc ssl3_accept_~s__shutdown~4; [L141] assume -2147483648 <= ssl3_accept_#t~nondet5 && ssl3_accept_#t~nondet5 <= 2147483647; [L142] ssl3_accept_~s__cert~4 := ssl3_accept_#t~nondet5; [L143] havoc ssl3_accept_#t~nondet5; [L144] assume -2147483648 <= ssl3_accept_#t~nondet6 && ssl3_accept_#t~nondet6 <= 2147483647; [L145] ssl3_accept_~s__options~4 := ssl3_accept_#t~nondet6; [L146] havoc ssl3_accept_#t~nondet6; [L147] assume -2147483648 <= ssl3_accept_#t~nondet7 && ssl3_accept_#t~nondet7 <= 2147483647; [L148] ssl3_accept_~s__verify_mode~4 := ssl3_accept_#t~nondet7; [L149] havoc ssl3_accept_#t~nondet7; [L150] assume -2147483648 <= ssl3_accept_#t~nondet8 && ssl3_accept_#t~nondet8 <= 2147483647; [L151] ssl3_accept_~s__session__peer~4 := ssl3_accept_#t~nondet8; [L152] havoc ssl3_accept_#t~nondet8; [L153] assume -2147483648 <= ssl3_accept_#t~nondet9 && ssl3_accept_#t~nondet9 <= 2147483647; [L154] ssl3_accept_~s__cert__pkeys__AT0__privatekey~4 := ssl3_accept_#t~nondet9; [L155] havoc ssl3_accept_#t~nondet9; [L156] assume -2147483648 <= ssl3_accept_#t~nondet10 && ssl3_accept_#t~nondet10 <= 2147483647; [L157] ssl3_accept_~s__ctx__info_callback~4 := ssl3_accept_#t~nondet10; [L158] havoc ssl3_accept_#t~nondet10; [L159] havoc ssl3_accept_~s__ctx__stats__sess_accept_renegotiate~4; [L160] havoc ssl3_accept_~s__ctx__stats__sess_accept~4; [L161] assume -2147483648 <= ssl3_accept_#t~nondet11 && ssl3_accept_#t~nondet11 <= 2147483647; [L162] ssl3_accept_~s__ctx__stats__sess_accept_good~4 := ssl3_accept_#t~nondet11; [L163] havoc ssl3_accept_#t~nondet11; [L164] havoc ssl3_accept_~s__s3__tmp__cert_request~4; [L165] assume -2147483648 <= ssl3_accept_#t~nondet12 && ssl3_accept_#t~nondet12 <= 2147483647; [L166] ssl3_accept_~s__s3__tmp__reuse_message~4 := ssl3_accept_#t~nondet12; [L167] havoc ssl3_accept_#t~nondet12; [L168] havoc ssl3_accept_~s__s3__tmp__use_rsa_tmp~4; [L169] assume -2147483648 <= ssl3_accept_#t~nondet13 && ssl3_accept_#t~nondet13 <= 2147483647; [L170] ssl3_accept_~s__s3__tmp__new_cipher~4 := ssl3_accept_#t~nondet13; [L171] havoc ssl3_accept_#t~nondet13; [L172] assume -2147483648 <= ssl3_accept_#t~nondet14 && ssl3_accept_#t~nondet14 <= 2147483647; [L173] ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4 := ssl3_accept_#t~nondet14; [L174] havoc ssl3_accept_#t~nondet14; [L175] havoc ssl3_accept_~s__s3__tmp__next_state___0~4; [L176] assume -2147483648 <= ssl3_accept_#t~nondet15 && ssl3_accept_#t~nondet15 <= 2147483647; [L177] ssl3_accept_~s__s3__tmp__new_cipher__algo_strength~4 := ssl3_accept_#t~nondet15; [L178] havoc ssl3_accept_#t~nondet15; [L179] havoc ssl3_accept_~s__session__cipher~4; [L180] havoc ssl3_accept_~buf~4; [L181] havoc ssl3_accept_~l~4; [L182] havoc ssl3_accept_~Time~4; [L183] havoc ssl3_accept_~tmp~4; [L184] havoc ssl3_accept_~cb~4; [L185] havoc ssl3_accept_~num1~4; [L186] havoc ssl3_accept_~ret~4; [L187] havoc ssl3_accept_~new_state~4; [L188] havoc ssl3_accept_~state~4; [L189] havoc ssl3_accept_~skip~4; [L190] havoc ssl3_accept_~got_new_session~4; [L191] assume -2147483648 <= ssl3_accept_#t~nondet16 && ssl3_accept_#t~nondet16 <= 2147483647; [L192] ssl3_accept_~tmp___1~4 := ssl3_accept_#t~nondet16; [L193] havoc ssl3_accept_#t~nondet16; [L194] assume -2147483648 <= ssl3_accept_#t~nondet17 && ssl3_accept_#t~nondet17 <= 2147483647; [L195] ssl3_accept_~tmp___2~4 := ssl3_accept_#t~nondet17; [L196] havoc ssl3_accept_#t~nondet17; [L197] assume -2147483648 <= ssl3_accept_#t~nondet18 && ssl3_accept_#t~nondet18 <= 2147483647; [L198] ssl3_accept_~tmp___3~4 := ssl3_accept_#t~nondet18; [L199] havoc ssl3_accept_#t~nondet18; [L200] assume -2147483648 <= ssl3_accept_#t~nondet19 && ssl3_accept_#t~nondet19 <= 2147483647; [L201] ssl3_accept_~tmp___4~4 := ssl3_accept_#t~nondet19; [L202] havoc ssl3_accept_#t~nondet19; [L203] assume -2147483648 <= ssl3_accept_#t~nondet20 && ssl3_accept_#t~nondet20 <= 2147483647; [L204] ssl3_accept_~tmp___5~4 := ssl3_accept_#t~nondet20; [L205] havoc ssl3_accept_#t~nondet20; [L206] assume -2147483648 <= ssl3_accept_#t~nondet21 && ssl3_accept_#t~nondet21 <= 2147483647; [L207] ssl3_accept_~tmp___6~4 := ssl3_accept_#t~nondet21; [L208] havoc ssl3_accept_#t~nondet21; [L209] havoc ssl3_accept_~tmp___7~4; [L210] assume -9223372036854775808 <= ssl3_accept_#t~nondet22 && ssl3_accept_#t~nondet22 <= 9223372036854775807; [L211] ssl3_accept_~tmp___8~4 := ssl3_accept_#t~nondet22; [L212] havoc ssl3_accept_#t~nondet22; [L213] assume -2147483648 <= ssl3_accept_#t~nondet23 && ssl3_accept_#t~nondet23 <= 2147483647; [L214] ssl3_accept_~tmp___9~4 := ssl3_accept_#t~nondet23; [L215] havoc ssl3_accept_#t~nondet23; [L216] assume -2147483648 <= ssl3_accept_#t~nondet24 && ssl3_accept_#t~nondet24 <= 2147483647; [L217] ssl3_accept_~tmp___10~4 := ssl3_accept_#t~nondet24; [L218] havoc ssl3_accept_#t~nondet24; [L219] havoc ssl3_accept_~blastFlag~4; [L220] havoc ssl3_accept_~__retres67~4; [L221] ssl3_accept_~s__state~4 := ssl3_accept_~initial_state; [L222] ssl3_accept_~blastFlag~4 := 0; [L223] assume -2147483648 <= ssl3_accept_#t~nondet25 && ssl3_accept_#t~nondet25 <= 2147483647; [L224] ssl3_accept_~tmp~4 := ssl3_accept_#t~nondet25; [L225] havoc ssl3_accept_#t~nondet25; [L226] ssl3_accept_~Time~4 := ssl3_accept_~tmp~4; [L227] ssl3_accept_~cb~4 := 0; [L228] ssl3_accept_~ret~4 := -1; [L229] ssl3_accept_~skip~4 := 0; [L230] ssl3_accept_~got_new_session~4 := 0; [L231] assume ssl3_accept_~s__info_callback~4 != 0; [L232] ssl3_accept_~cb~4 := ssl3_accept_~s__info_callback~4; [L233] ssl3_accept_~s__in_handshake~4 := ssl3_accept_~s__in_handshake~4 + 1; [L234] assume !(~bitwiseAnd(ssl3_accept_~tmp___1~4, 12288) != 0); [L235] assume !(ssl3_accept_~s__cert~4 == 0); [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L253] assume ssl3_accept_~s__state~4 == 8464; [L254] ssl3_accept_~s__shutdown~4 := 0; [L255] assume -2147483648 <= ssl3_accept_#t~nondet28 && ssl3_accept_#t~nondet28 <= 2147483647; [L256] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet28; [L257] havoc ssl3_accept_#t~nondet28; [L258] assume ssl3_accept_~blastFlag~4 == 0; [L259] ssl3_accept_~blastFlag~4 := 1; [L260] assume !(ssl3_accept_~ret~4 <= 0); [L261] ssl3_accept_~got_new_session~4 := 1; [L262] ssl3_accept_~s__state~4 := 8496; [L263] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L277] assume ssl3_accept_~s__state~4 == 8496; [L278] assume -2147483648 <= ssl3_accept_#t~nondet29 && ssl3_accept_#t~nondet29 <= 2147483647; [L279] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet29; [L280] havoc ssl3_accept_#t~nondet29; [L281] assume ssl3_accept_~blastFlag~4 == 1; [L282] ssl3_accept_~blastFlag~4 := 2; [L283] assume !(ssl3_accept_~ret~4 <= 0); [L284] assume !(ssl3_accept_~s__hit~4 != 0); [L285] ssl3_accept_~s__state~4 := 8512; [L286] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L295] assume ssl3_accept_~s__state~4 == 8512; [L296] assume ~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0; [L297] ssl3_accept_~skip~4 := 1; [L298] ssl3_accept_~s__state~4 := 8528; [L299] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L308] assume ssl3_accept_~s__state~4 == 8528; [L309] ssl3_accept_~l~4 := ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4; [L310] assume ~bitwiseAnd(ssl3_accept_~s__options~4, 2097152) % 18446744073709551616 != 0; [L311] ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 := 1; [L312] assume ssl3_accept_~s__s3__tmp__use_rsa_tmp~4 != 0; [L313] assume -2147483648 <= ssl3_accept_#t~nondet31 && ssl3_accept_#t~nondet31 <= 2147483647; [L314] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet31; [L315] havoc ssl3_accept_#t~nondet31; [L316] assume !(ssl3_accept_~ret~4 <= 0); [L317] ssl3_accept_~s__state~4 := 8544; [L318] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L327] assume ssl3_accept_~s__state~4 == 8544; [L328] assume ~bitwiseAnd(ssl3_accept_~s__verify_mode~4, 1) != 0; [L329] assume !(ssl3_accept_~s__session__peer~4 != 0); [L330] assume !(~bitwiseAnd(ssl3_accept_~s__s3__tmp__new_cipher__algorithms~4, 256) % 18446744073709551616 != 0); [L331] ssl3_accept_~s__s3__tmp__cert_request~4 := 1; [L332] assume -2147483648 <= ssl3_accept_#t~nondet32 && ssl3_accept_#t~nondet32 <= 2147483647; [L333] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet32; [L334] havoc ssl3_accept_#t~nondet32; [L335] assume !(ssl3_accept_~ret~4 <= 0); [L336] ssl3_accept_~s__state~4 := 8448; [L337] ssl3_accept_~s__s3__tmp__next_state___0~4 := 8576; [L338] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L349] assume ssl3_accept_~s__state~4 == 8448; [L350] assume !(ssl3_accept_~num1~4 > 0); [L351] ssl3_accept_~s__state~4 := ssl3_accept_~s__s3__tmp__next_state___0~4; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L359] assume ssl3_accept_~s__state~4 == 8576; [L360] assume -2147483648 <= ssl3_accept_#t~nondet34 && ssl3_accept_#t~nondet34 <= 2147483647; [L361] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet34; [L362] havoc ssl3_accept_#t~nondet34; [L363] assume !(ssl3_accept_~ret~4 <= 0); [L364] assume !(ssl3_accept_~ret~4 == 2); [L365] assume -2147483648 <= ssl3_accept_#t~nondet35 && ssl3_accept_#t~nondet35 <= 2147483647; [L366] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet35; [L367] havoc ssl3_accept_#t~nondet35; [L368] assume !(ssl3_accept_~ret~4 <= 0); [L369] ssl3_accept_~s__init_num~4 := 0; [L370] ssl3_accept_~s__state~4 := 8592; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L379] assume ssl3_accept_~s__state~4 == 8592; [L380] assume -2147483648 <= ssl3_accept_#t~nondet36 && ssl3_accept_#t~nondet36 <= 2147483647; [L381] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet36; [L382] havoc ssl3_accept_#t~nondet36; [L383] assume !(ssl3_accept_~ret~4 <= 0); [L384] ssl3_accept_~s__state~4 := 8608; [L385] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L394] assume ssl3_accept_~s__state~4 == 8608; [L395] assume -2147483648 <= ssl3_accept_#t~nondet37 && ssl3_accept_#t~nondet37 <= 2147483647; [L396] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet37; [L397] havoc ssl3_accept_#t~nondet37; [L398] assume !(ssl3_accept_~ret~4 <= 0); [L399] ssl3_accept_~s__state~4 := 8640; [L400] assume -2147483648 <= ssl3_accept_#t~nondet38 && ssl3_accept_#t~nondet38 <= 2147483647; [L401] ssl3_accept_~s__s3__tmp__next_state___0~4 := ssl3_accept_#t~nondet38; [L402] havoc ssl3_accept_#t~nondet38; [L403] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L406] assume !(ssl3_accept_~s__state~4 == 8608); [L407] assume !(ssl3_accept_~s__state~4 == 8609); [L412] assume ssl3_accept_~s__state~4 == 8640; [L413] assume -2147483648 <= ssl3_accept_#t~nondet39 && ssl3_accept_#t~nondet39 <= 2147483647; [L414] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet39; [L415] havoc ssl3_accept_#t~nondet39; [L428] assume !(ssl3_accept_~blastFlag~4 == 3); [L449] assume !(ssl3_accept_~ret~4 <= 0); [L450] assume !(ssl3_accept_~s__hit~4 != 0); [L451] ssl3_accept_~s__state~4 := 8656; [L452] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L406] assume !(ssl3_accept_~s__state~4 == 8608); [L407] assume !(ssl3_accept_~s__state~4 == 8609); [L418] assume !(ssl3_accept_~s__state~4 == 8640); [L419] assume !(ssl3_accept_~s__state~4 == 8641); [L433] assume ssl3_accept_~s__state~4 == 8656; [L434] ssl3_accept_~s__session__cipher~4 := ssl3_accept_~s__s3__tmp__new_cipher~4; [L435] assume !(ssl3_accept_~tmp___9~4 == 0); [L436] assume -2147483648 <= ssl3_accept_#t~nondet40 && ssl3_accept_#t~nondet40 <= 2147483647; [L437] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet40; [L438] havoc ssl3_accept_#t~nondet40; [L457] assume ssl3_accept_~blastFlag~4 == 2; [L458] ssl3_accept_~blastFlag~4 := 3; [L478] assume !(ssl3_accept_~ret~4 <= 0); [L479] ssl3_accept_~s__state~4 := 8672; [L480] ssl3_accept_~s__init_num~4 := 0; [L481] assume !(ssl3_accept_~tmp___10~4 == 0); [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L406] assume !(ssl3_accept_~s__state~4 == 8608); [L407] assume !(ssl3_accept_~s__state~4 == 8609); [L412] assume ssl3_accept_~s__state~4 == 8640; [L413] assume -2147483648 <= ssl3_accept_#t~nondet39 && ssl3_accept_#t~nondet39 <= 2147483647; [L414] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet39; [L415] havoc ssl3_accept_#t~nondet39; [L424] assume ssl3_accept_~blastFlag~4 == 3; [L425] 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); [L449] assume !(ssl3_accept_~ret~4 <= 0); [L450] assume !(ssl3_accept_~s__hit~4 != 0); [L451] ssl3_accept_~s__state~4 := 8656; [L452] ssl3_accept_~s__init_num~4 := 0; [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L406] assume !(ssl3_accept_~s__state~4 == 8608); [L407] assume !(ssl3_accept_~s__state~4 == 8609); [L418] assume !(ssl3_accept_~s__state~4 == 8640); [L419] assume !(ssl3_accept_~s__state~4 == 8641); [L433] assume ssl3_accept_~s__state~4 == 8656; [L434] ssl3_accept_~s__session__cipher~4 := ssl3_accept_~s__s3__tmp__new_cipher~4; [L435] assume !(ssl3_accept_~tmp___9~4 == 0); [L436] assume -2147483648 <= ssl3_accept_#t~nondet40 && ssl3_accept_#t~nondet40 <= 2147483647; [L437] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet40; [L438] havoc ssl3_accept_#t~nondet40; [L461] assume !(ssl3_accept_~blastFlag~4 == 2); [L478] assume !(ssl3_accept_~ret~4 <= 0); [L479] ssl3_accept_~s__state~4 := 8672; [L480] ssl3_accept_~s__init_num~4 := 0; [L481] assume !(ssl3_accept_~tmp___10~4 == 0); [L271] assume !(ssl3_accept_~s__s3__tmp__reuse_message~4 == 0); [L272] ssl3_accept_~skip~4 := 0; [L238] assume true; [L239] assume !false; [L240] ssl3_accept_~state~4 := ssl3_accept_~s__state~4; [L241] assume !(ssl3_accept_~s__state~4 == 12292); [L242] assume !(ssl3_accept_~s__state~4 == 16384); [L243] assume !(ssl3_accept_~s__state~4 == 8192); [L244] assume !(ssl3_accept_~s__state~4 == 24576); [L245] assume !(ssl3_accept_~s__state~4 == 8195); [L246] assume !(ssl3_accept_~s__state~4 == 8480); [L247] assume !(ssl3_accept_~s__state~4 == 8481); [L248] assume !(ssl3_accept_~s__state~4 == 8482); [L266] assume !(ssl3_accept_~s__state~4 == 8464); [L267] assume !(ssl3_accept_~s__state~4 == 8465); [L268] assume !(ssl3_accept_~s__state~4 == 8466); [L289] assume !(ssl3_accept_~s__state~4 == 8496); [L290] assume !(ssl3_accept_~s__state~4 == 8497); [L302] assume !(ssl3_accept_~s__state~4 == 8512); [L303] assume !(ssl3_accept_~s__state~4 == 8513); [L321] assume !(ssl3_accept_~s__state~4 == 8528); [L322] assume !(ssl3_accept_~s__state~4 == 8529); [L341] assume !(ssl3_accept_~s__state~4 == 8544); [L342] assume !(ssl3_accept_~s__state~4 == 8545); [L343] assume !(ssl3_accept_~s__state~4 == 8560); [L344] assume !(ssl3_accept_~s__state~4 == 8561); [L354] assume !(ssl3_accept_~s__state~4 == 8448); [L373] assume !(ssl3_accept_~s__state~4 == 8576); [L374] assume !(ssl3_accept_~s__state~4 == 8577); [L388] assume !(ssl3_accept_~s__state~4 == 8592); [L389] assume !(ssl3_accept_~s__state~4 == 8593); [L406] assume !(ssl3_accept_~s__state~4 == 8608); [L407] assume !(ssl3_accept_~s__state~4 == 8609); [L418] assume !(ssl3_accept_~s__state~4 == 8640); [L419] assume !(ssl3_accept_~s__state~4 == 8641); [L441] assume !(ssl3_accept_~s__state~4 == 8656); [L442] assume !(ssl3_accept_~s__state~4 == 8657); [L443] assume ssl3_accept_~s__state~4 == 8672; [L444] assume -2147483648 <= ssl3_accept_#t~nondet41 && ssl3_accept_#t~nondet41 <= 2147483647; [L445] ssl3_accept_~ret~4 := ssl3_accept_#t~nondet41; [L446] havoc ssl3_accept_#t~nondet41; [L474] assume ssl3_accept_~blastFlag~4 == 4; [L475] assume !false; [L484] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 271 locations, 1 error locations. UNKNOWN Result, 9.4s OverallTime, 14 OverallIterations, 14 TraceHistogramMax, 5.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3906 SDtfs, 470 SDslu, 3165 SDs, 0 SdLazy, 963 SolverSat, 94 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s 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=1538occurred 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.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 400 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 4552 NumberOfCodeBlocks, 4552 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 4539 ConstructedInterpolants, 0 QuantifiedInterpolants, 2423469 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_alt.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-15_15-35-04-725.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_srvr_3_alt.BV.c.cil.c_19.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_15-35-04-725.csv Received shutdown request...