java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d19836b [2018-09-26 21:53:34,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 21:53:34,914 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 21:53:34,924 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 21:53:34,924 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 21:53:34,925 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 21:53:34,927 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 21:53:34,930 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 21:53:34,931 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 21:53:34,932 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 21:53:34,933 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 21:53:34,933 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 21:53:34,934 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 21:53:34,935 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 21:53:34,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 21:53:34,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 21:53:34,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 21:53:34,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 21:53:34,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 21:53:34,943 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 21:53:34,944 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 21:53:34,945 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 21:53:34,948 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 21:53:34,948 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 21:53:34,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 21:53:34,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 21:53:34,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 21:53:34,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 21:53:34,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 21:53:34,954 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 21:53:34,954 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 21:53:34,955 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 21:53:34,955 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 21:53:34,955 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 21:53:34,956 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 21:53:34,957 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 21:53:34,957 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default_PUPT.epf [2018-09-26 21:53:34,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 21:53:34,973 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 21:53:34,973 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-26 21:53:34,974 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-26 21:53:34,974 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-26 21:53:34,974 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-26 21:53:34,975 INFO L133 SettingsManager]: * Use SBE=true [2018-09-26 21:53:34,975 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-26 21:53:34,975 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-26 21:53:34,975 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-26 21:53:34,976 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-26 21:53:34,977 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-26 21:53:34,977 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-26 21:53:34,977 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 21:53:34,977 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-26 21:53:34,977 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-26 21:53:34,978 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-26 21:53:34,978 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:34,978 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 21:53:34,978 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-26 21:53:34,978 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-26 21:53:34,979 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-26 21:53:34,979 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-26 21:53:34,979 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-26 21:53:34,979 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 21:53:34,979 INFO L133 SettingsManager]: * Use predicate trie based predicate unification=true [2018-09-26 21:53:35,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 21:53:35,039 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 21:53:35,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 21:53:35,044 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 21:53:35,045 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 21:53:35,046 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl [2018-09-26 21:53:35,046 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_clnt_2.cil.c_21.bpl' [2018-09-26 21:53:35,121 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 21:53:35,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 21:53:35,126 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:35,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 21:53:35,126 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 21:53:35,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 21:53:35,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 21:53:35,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 21:53:35,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 21:53:35,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,214 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... [2018-09-26 21:53:35,219 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 21:53:35,219 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 21:53:35,220 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 21:53:35,220 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 21:53:35,221 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-26 21:53:35,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 21:53:35,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 21:53:36,017 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 21:53:36,018 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:36 BoogieIcfgContainer [2018-09-26 21:53:36,018 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 21:53:36,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 21:53:36,019 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 21:53:36,022 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 21:53:36,022 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 09:53:35" (1/2) ... [2018-09-26 21:53:36,023 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1773c2a9 and model type s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 09:53:36, skipping insertion in model container [2018-09-26 21:53:36,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 09:53:36" (2/2) ... [2018-09-26 21:53:36,025 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil.c_21.bpl [2018-09-26 21:53:36,035 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-26 21:53:36,045 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 21:53:36,095 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 21:53:36,096 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 21:53:36,096 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 21:53:36,096 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-26 21:53:36,096 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 21:53:36,097 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 21:53:36,097 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 21:53:36,097 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 21:53:36,097 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 21:53:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-09-26 21:53:36,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 21:53:36,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:36,125 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:36,126 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:36,133 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:36,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2097985007, now seen corresponding path program 1 times [2018-09-26 21:53:36,136 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:36,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:36,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:36,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:36,336 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:36,336 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 21:53:36,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:36,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:36,352 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:36,354 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 3 states. [2018-09-26 21:53:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:36,848 INFO L93 Difference]: Finished difference Result 49 states and 80 transitions. [2018-09-26 21:53:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:36,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-09-26 21:53:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:36,865 INFO L225 Difference]: With dead ends: 49 [2018-09-26 21:53:36,865 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 21:53:36,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:36,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 21:53:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 21:53:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 21:53:36,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 40 transitions. [2018-09-26 21:53:36,912 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 40 transitions. Word has length 10 [2018-09-26 21:53:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:36,912 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 40 transitions. [2018-09-26 21:53:36,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:36,912 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 40 transitions. [2018-09-26 21:53:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 21:53:36,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:36,913 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:36,914 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:36,914 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -509365433, now seen corresponding path program 1 times [2018-09-26 21:53:36,914 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:36,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:36,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:36,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:36,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:37,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 21:53:37,035 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:37,035 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:37,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:37,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:37,037 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:37,037 INFO L87 Difference]: Start difference. First operand 26 states and 40 transitions. Second operand 3 states. [2018-09-26 21:53:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:37,419 INFO L93 Difference]: Finished difference Result 53 states and 83 transitions. [2018-09-26 21:53:37,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:37,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-09-26 21:53:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:37,420 INFO L225 Difference]: With dead ends: 53 [2018-09-26 21:53:37,421 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 21:53:37,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 21:53:37,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 21:53:37,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 21:53:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 44 transitions. [2018-09-26 21:53:37,429 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 44 transitions. Word has length 13 [2018-09-26 21:53:37,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:37,431 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 44 transitions. [2018-09-26 21:53:37,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 44 transitions. [2018-09-26 21:53:37,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 21:53:37,433 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:37,433 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:37,433 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:37,433 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:37,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1912029775, now seen corresponding path program 1 times [2018-09-26 21:53:37,434 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:37,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:37,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:37,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:37,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:37,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:37,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-26 21:53:37,571 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:37,571 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:37,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:37,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:37,573 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:37,573 INFO L87 Difference]: Start difference. First operand 30 states and 44 transitions. Second operand 3 states. [2018-09-26 21:53:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:37,926 INFO L93 Difference]: Finished difference Result 62 states and 93 transitions. [2018-09-26 21:53:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:37,927 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-09-26 21:53:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:37,928 INFO L225 Difference]: With dead ends: 62 [2018-09-26 21:53:37,928 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 21:53:37,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 21:53:37,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 21:53:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 21:53:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2018-09-26 21:53:37,939 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 19 [2018-09-26 21:53:37,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:37,940 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-09-26 21:53:37,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:37,940 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2018-09-26 21:53:37,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 21:53:37,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:37,943 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:37,944 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:37,944 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1719277757, now seen corresponding path program 1 times [2018-09-26 21:53:37,945 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:37,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:37,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:37,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:38,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-09-26 21:53:38,051 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:38,051 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:38,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:38,052 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:38,053 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 3 states. [2018-09-26 21:53:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:38,584 INFO L93 Difference]: Finished difference Result 73 states and 105 transitions. [2018-09-26 21:53:38,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:38,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-09-26 21:53:38,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:38,586 INFO L225 Difference]: With dead ends: 73 [2018-09-26 21:53:38,586 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 21:53:38,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:38,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 21:53:38,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 21:53:38,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 21:53:38,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 55 transitions. [2018-09-26 21:53:38,595 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 55 transitions. Word has length 26 [2018-09-26 21:53:38,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:38,596 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 55 transitions. [2018-09-26 21:53:38,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:38,596 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 55 transitions. [2018-09-26 21:53:38,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 21:53:38,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:38,597 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:38,597 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:38,598 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:38,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1612801811, now seen corresponding path program 1 times [2018-09-26 21:53:38,598 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:38,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:38,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:38,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:38,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:38,656 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:53:38,657 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:38,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:38,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:38,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:38,658 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:38,658 INFO L87 Difference]: Start difference. First operand 41 states and 55 transitions. Second operand 3 states. [2018-09-26 21:53:38,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:38,965 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2018-09-26 21:53:38,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:38,966 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-09-26 21:53:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:38,968 INFO L225 Difference]: With dead ends: 86 [2018-09-26 21:53:38,968 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 21:53:38,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 21:53:38,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 21:53:38,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 21:53:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2018-09-26 21:53:38,977 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 62 transitions. Word has length 34 [2018-09-26 21:53:38,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:38,978 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 62 transitions. [2018-09-26 21:53:38,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 62 transitions. [2018-09-26 21:53:38,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 21:53:38,980 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:38,980 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:38,980 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:38,980 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:38,980 INFO L82 PathProgramCache]: Analyzing trace with hash -168763707, now seen corresponding path program 1 times [2018-09-26 21:53:38,981 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:38,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:38,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:38,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:38,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-26 21:53:39,106 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:39,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,107 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,108 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. Second operand 3 states. [2018-09-26 21:53:39,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,270 INFO L93 Difference]: Finished difference Result 136 states and 179 transitions. [2018-09-26 21:53:39,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:39,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-26 21:53:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,277 INFO L225 Difference]: With dead ends: 136 [2018-09-26 21:53:39,277 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 21:53:39,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 21:53:39,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 21:53:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 21:53:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 117 transitions. [2018-09-26 21:53:39,291 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 117 transitions. Word has length 43 [2018-09-26 21:53:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,292 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 117 transitions. [2018-09-26 21:53:39,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 117 transitions. [2018-09-26 21:53:39,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 21:53:39,294 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:39,294 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:39,295 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:39,295 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash 253938119, now seen corresponding path program 1 times [2018-09-26 21:53:39,295 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:39,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:39,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:39,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-09-26 21:53:39,402 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:39,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,403 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,403 INFO L87 Difference]: Start difference. First operand 91 states and 117 transitions. Second operand 3 states. [2018-09-26 21:53:39,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,562 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2018-09-26 21:53:39,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:39,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-26 21:53:39,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,564 INFO L225 Difference]: With dead ends: 188 [2018-09-26 21:53:39,564 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 21:53:39,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 21:53:39,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 21:53:39,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 21:53:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2018-09-26 21:53:39,585 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 43 [2018-09-26 21:53:39,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,586 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2018-09-26 21:53:39,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2018-09-26 21:53:39,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 21:53:39,587 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:39,588 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:39,588 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:39,588 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:39,588 INFO L82 PathProgramCache]: Analyzing trace with hash -4227319, now seen corresponding path program 1 times [2018-09-26 21:53:39,589 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:39,589 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:39,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,695 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-09-26 21:53:39,695 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,695 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:39,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,696 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,696 INFO L87 Difference]: Start difference. First operand 100 states and 126 transitions. Second operand 3 states. [2018-09-26 21:53:39,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:39,859 INFO L93 Difference]: Finished difference Result 139 states and 179 transitions. [2018-09-26 21:53:39,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:39,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-09-26 21:53:39,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:39,865 INFO L225 Difference]: With dead ends: 139 [2018-09-26 21:53:39,865 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 21:53:39,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:39,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 21:53:39,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-09-26 21:53:39,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 21:53:39,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 171 transitions. [2018-09-26 21:53:39,886 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 171 transitions. Word has length 43 [2018-09-26 21:53:39,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:39,887 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 171 transitions. [2018-09-26 21:53:39,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:39,887 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 171 transitions. [2018-09-26 21:53:39,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 21:53:39,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:39,893 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:39,893 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:39,894 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:39,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1562207431, now seen corresponding path program 1 times [2018-09-26 21:53:39,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:39,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:39,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:39,974 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-09-26 21:53:39,975 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:39,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:39,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:39,976 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:39,976 INFO L87 Difference]: Start difference. First operand 132 states and 171 transitions. Second operand 3 states. [2018-09-26 21:53:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:40,279 INFO L93 Difference]: Finished difference Result 297 states and 405 transitions. [2018-09-26 21:53:40,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:40,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2018-09-26 21:53:40,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:40,281 INFO L225 Difference]: With dead ends: 297 [2018-09-26 21:53:40,281 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 21:53:40,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:40,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 21:53:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 21:53:40,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 21:53:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 222 transitions. [2018-09-26 21:53:40,301 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 222 transitions. Word has length 73 [2018-09-26 21:53:40,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:40,302 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 222 transitions. [2018-09-26 21:53:40,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 222 transitions. [2018-09-26 21:53:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 21:53:40,304 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:40,305 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:40,305 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:40,305 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:40,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1926453931, now seen corresponding path program 2 times [2018-09-26 21:53:40,306 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:40,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:40,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:40,433 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-09-26 21:53:40,434 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:40,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:40,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:40,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:40,436 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:40,436 INFO L87 Difference]: Start difference. First operand 168 states and 222 transitions. Second operand 3 states. [2018-09-26 21:53:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:41,564 INFO L93 Difference]: Finished difference Result 405 states and 558 transitions. [2018-09-26 21:53:41,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:41,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2018-09-26 21:53:41,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:41,567 INFO L225 Difference]: With dead ends: 405 [2018-09-26 21:53:41,567 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 21:53:41,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:41,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 21:53:41,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 21:53:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 21:53:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 297 transitions. [2018-09-26 21:53:41,592 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 297 transitions. Word has length 76 [2018-09-26 21:53:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:41,593 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 297 transitions. [2018-09-26 21:53:41,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 297 transitions. [2018-09-26 21:53:41,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 21:53:41,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:41,596 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 10, 8, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:41,596 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:41,596 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1254900833, now seen corresponding path program 1 times [2018-09-26 21:53:41,597 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:41,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,598 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-26 21:53:41,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:41,704 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-26 21:53:41,705 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:41,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:41,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:41,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:41,706 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:41,706 INFO L87 Difference]: Start difference. First operand 228 states and 297 transitions. Second operand 3 states. [2018-09-26 21:53:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:42,504 INFO L93 Difference]: Finished difference Result 489 states and 642 transitions. [2018-09-26 21:53:42,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:42,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2018-09-26 21:53:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:42,507 INFO L225 Difference]: With dead ends: 489 [2018-09-26 21:53:42,507 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 21:53:42,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:42,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 21:53:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 21:53:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 21:53:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 327 transitions. [2018-09-26 21:53:42,533 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 327 transitions. Word has length 85 [2018-09-26 21:53:42,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:42,533 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 327 transitions. [2018-09-26 21:53:42,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:42,534 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 327 transitions. [2018-09-26 21:53:42,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 21:53:42,535 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:42,536 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 11, 9, 7, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-26 21:53:42,536 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:42,536 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:42,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1359801879, now seen corresponding path program 1 times [2018-09-26 21:53:42,536 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:42,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:42,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:42,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:42,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:42,649 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 214 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2018-09-26 21:53:42,650 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:42,650 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:42,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:42,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:42,651 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:42,651 INFO L87 Difference]: Start difference. First operand 255 states and 327 transitions. Second operand 3 states. [2018-09-26 21:53:43,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:43,964 INFO L93 Difference]: Finished difference Result 543 states and 702 transitions. [2018-09-26 21:53:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:43,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2018-09-26 21:53:43,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:43,967 INFO L225 Difference]: With dead ends: 543 [2018-09-26 21:53:43,967 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 21:53:43,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:43,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 21:53:43,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 21:53:43,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 21:53:43,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 363 transitions. [2018-09-26 21:53:43,989 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 363 transitions. Word has length 94 [2018-09-26 21:53:43,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:43,990 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 363 transitions. [2018-09-26 21:53:43,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:43,990 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 363 transitions. [2018-09-26 21:53:43,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 21:53:43,992 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:43,992 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 12, 10, 8, 6, 4, 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] [2018-09-26 21:53:43,992 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:43,992 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:43,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1195726822, now seen corresponding path program 1 times [2018-09-26 21:53:43,993 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:43,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:43,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:43,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:43,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:44,119 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 247 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2018-09-26 21:53:44,120 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:44,120 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:44,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:44,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:44,121 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:44,121 INFO L87 Difference]: Start difference. First operand 285 states and 363 transitions. Second operand 3 states. [2018-09-26 21:53:44,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:44,426 INFO L93 Difference]: Finished difference Result 603 states and 774 transitions. [2018-09-26 21:53:44,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:44,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2018-09-26 21:53:44,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:44,429 INFO L225 Difference]: With dead ends: 603 [2018-09-26 21:53:44,429 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 21:53:44,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:44,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 21:53:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-26 21:53:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 21:53:44,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2018-09-26 21:53:44,452 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 104 [2018-09-26 21:53:44,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:44,452 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2018-09-26 21:53:44,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:44,452 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2018-09-26 21:53:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 21:53:44,454 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:44,454 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 13, 11, 9, 7, 5, 3, 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] [2018-09-26 21:53:44,454 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:44,454 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:44,455 INFO L82 PathProgramCache]: Analyzing trace with hash -32649186, now seen corresponding path program 1 times [2018-09-26 21:53:44,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:44,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2018-09-26 21:53:44,584 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:44,584 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:44,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:44,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:44,585 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:44,585 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand 3 states. [2018-09-26 21:53:45,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:45,165 INFO L93 Difference]: Finished difference Result 633 states and 807 transitions. [2018-09-26 21:53:45,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:45,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2018-09-26 21:53:45,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:45,168 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:53:45,168 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 21:53:45,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 21:53:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-26 21:53:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 21:53:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 402 transitions. [2018-09-26 21:53:45,191 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 402 transitions. Word has length 115 [2018-09-26 21:53:45,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:45,192 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 402 transitions. [2018-09-26 21:53:45,192 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:45,192 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 402 transitions. [2018-09-26 21:53:45,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 21:53:45,194 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:45,194 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 12, 10, 8, 6, 4, 3, 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] [2018-09-26 21:53:45,194 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:45,194 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:45,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1066373693, now seen corresponding path program 1 times [2018-09-26 21:53:45,195 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:45,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:45,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:45,320 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 285 proven. 0 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-26 21:53:45,320 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 21:53:45,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-26 21:53:45,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 21:53:45,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 21:53:45,321 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:45,322 INFO L87 Difference]: Start difference. First operand 318 states and 402 transitions. Second operand 3 states. [2018-09-26 21:53:46,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:46,074 INFO L93 Difference]: Finished difference Result 633 states and 801 transitions. [2018-09-26 21:53:46,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 21:53:46,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-09-26 21:53:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:46,083 INFO L225 Difference]: With dead ends: 633 [2018-09-26 21:53:46,083 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 21:53:46,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 21:53:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-26 21:53:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 21:53:46,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 387 transitions. [2018-09-26 21:53:46,105 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 387 transitions. Word has length 124 [2018-09-26 21:53:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:46,105 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 387 transitions. [2018-09-26 21:53:46,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 21:53:46,105 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 387 transitions. [2018-09-26 21:53:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 21:53:46,107 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:46,107 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 13, 11, 9, 7, 5, 4, 3, 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] [2018-09-26 21:53:46,107 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:46,108 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:46,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1427413192, now seen corresponding path program 1 times [2018-09-26 21:53:46,108 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:46,108 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:46,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:46,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:46,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-26 21:53:46,320 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:46,323 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:53:46,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:46,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:47,043 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 385 proven. 4 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2018-09-26 21:53:47,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:47,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:53:47,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:47,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:47,079 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:47,079 INFO L87 Difference]: Start difference. First operand 318 states and 387 transitions. Second operand 4 states. [2018-09-26 21:53:49,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:49,082 INFO L93 Difference]: Finished difference Result 757 states and 914 transitions. [2018-09-26 21:53:49,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 21:53:49,083 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2018-09-26 21:53:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:49,085 INFO L225 Difference]: With dead ends: 757 [2018-09-26 21:53:49,085 INFO L226 Difference]: Without dead ends: 415 [2018-09-26 21:53:49,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-09-26 21:53:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 255. [2018-09-26 21:53:49,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 21:53:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 291 transitions. [2018-09-26 21:53:49,114 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 291 transitions. Word has length 136 [2018-09-26 21:53:49,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:49,115 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 291 transitions. [2018-09-26 21:53:49,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:49,115 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 291 transitions. [2018-09-26 21:53:49,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 21:53:49,116 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 21:53:49,116 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 15, 13, 11, 9, 7, 5, 4, 3, 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] [2018-09-26 21:53:49,117 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 21:53:49,117 INFO L99 BPredicateUnifier]: Initialized predicate-trie based predicate unifier [2018-09-26 21:53:49,117 INFO L82 PathProgramCache]: Analyzing trace with hash 2065701642, now seen corresponding path program 2 times [2018-09-26 21:53:49,117 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-26 21:53:49,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-26 21:53:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:49,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-26 21:53:49,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-26 21:53:49,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 21:53:49,332 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-09-26 21:53:49,333 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-26 21:53:49,333 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-26 21:53:49,350 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-26 21:53:49,483 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-26 21:53:49,483 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-26 21:53:49,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-26 21:53:49,904 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 417 proven. 3 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2018-09-26 21:53:49,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-26 21:53:49,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-09-26 21:53:49,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 21:53:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 21:53:49,934 INFO L146 InterpolantAutomaton]: No coverage relation statistics for PredicateCoverageChecker [2018-09-26 21:53:49,934 INFO L87 Difference]: Start difference. First operand 255 states and 291 transitions. Second operand 4 states. [2018-09-26 21:53:50,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 21:53:50,610 INFO L93 Difference]: Finished difference Result 429 states and 487 transitions. [2018-09-26 21:53:50,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 21:53:50,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2018-09-26 21:53:50,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 21:53:50,619 INFO L225 Difference]: With dead ends: 429 [2018-09-26 21:53:50,619 INFO L226 Difference]: Without dead ends: 0 [2018-09-26 21:53:50,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time [2018-09-26 21:53:50,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-26 21:53:50,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-26 21:53:50,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-26 21:53:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-26 21:53:50,621 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 139 [2018-09-26 21:53:50,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 21:53:50,621 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-26 21:53:50,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 21:53:50,621 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-26 21:53:50,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-26 21:53:50,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-26 21:53:50,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,679 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,685 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,701 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,738 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,741 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,797 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,802 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,813 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,814 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,830 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,832 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,846 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,883 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,937 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,943 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,965 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,966 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:50,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-26 21:53:51,215 WARN L178 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 7 [2018-09-26 21:53:51,916 WARN L178 SmtUtils]: Spent 698.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2018-09-26 21:53:52,617 WARN L178 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2018-09-26 21:53:53,612 WARN L178 SmtUtils]: Spent 992.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-09-26 21:53:53,881 WARN L178 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-09-26 21:53:54,132 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-09-26 21:53:54,408 WARN L178 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 27 [2018-09-26 21:53:54,615 WARN L178 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-09-26 21:53:54,920 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2018-09-26 21:53:55,135 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2018-09-26 21:53:55,152 INFO L422 ceAbstractionStarter]: At program point L415(lines 415 432) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) [2018-09-26 21:53:55,152 INFO L422 ceAbstractionStarter]: At program point L382(lines 373 395) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0) (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)))) [2018-09-26 21:53:55,152 INFO L422 ceAbstractionStarter]: At program point L407(lines 404 420) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (= ULTIMATE.start_ssl3_connect_~s__state~4 4416)) [2018-09-26 21:53:55,153 INFO L422 ceAbstractionStarter]: At program point L300(lines 261 300) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-09-26 21:53:55,153 INFO L422 ceAbstractionStarter]: At program point L296(lines 296 310) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-09-26 21:53:55,153 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 526) no Hoare annotation was computed. [2018-09-26 21:53:55,153 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 526) no Hoare annotation was computed. [2018-09-26 21:53:55,153 INFO L422 ceAbstractionStarter]: At program point L313(lines 313 333) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-09-26 21:53:55,153 INFO L422 ceAbstractionStarter]: At program point L309(lines 309 320) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L499(lines 499 516) the Hoare annotation is: (let ((.cse1 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse1) (and .cse0 .cse1 .cse2))) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4512)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2))) [2018-09-26 21:53:55,154 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 526) no Hoare annotation was computed. [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L351(lines 348 362) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L479(lines 479 496) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4480)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-09-26 21:53:55,154 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 459) no Hoare annotation was computed. [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L525(lines 289 525) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse3 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse2) (and .cse3 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse3))) [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L336(lines 336 358) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse2 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse2 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 .cse2))) [2018-09-26 21:53:55,154 INFO L422 ceAbstractionStarter]: At program point L431(lines 431 458) the Hoare annotation is: false [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L332(lines 332 349) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L460(lines 457 474) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4448)))) [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L266(lines 266 290) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560)) (.cse3 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2)) (.cse4 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 12292)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4384)) (and .cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) (and .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4560) .cse3 .cse2) (and .cse0 .cse3 .cse2) (and .cse4 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and .cse0 .cse4))) [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L394(lines 394 416) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0))) [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L361(lines 361 391) the Hoare annotation is: (let ((.cse0 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4)) (.cse1 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and .cse1 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse1))) [2018-09-26 21:53:55,155 INFO L422 ceAbstractionStarter]: At program point L390(lines 390 405) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_ssl3_connect_~s__state~4 4416))) (or (and .cse0 (= ULTIMATE.start_ssl3_connect_~blastFlag~4 3)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) .cse0))) [2018-09-26 21:53:55,156 INFO L422 ceAbstractionStarter]: At program point L357(lines 357 374) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4400)) [2018-09-26 21:53:55,156 INFO L422 ceAbstractionStarter]: At program point L324(lines 319 337) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 2) (= ULTIMATE.start_ssl3_connect_~s__state~4 4368)) [2018-09-26 21:53:55,156 INFO L422 ceAbstractionStarter]: At program point L419(lines 419 450) the Hoare annotation is: (let ((.cse0 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~4)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4))) (or (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4528) (<= ULTIMATE.start_ssl3_connect_~blastFlag~4 4) .cse0) (and (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~4 4560) .cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~4 4352)) (and (<= ULTIMATE.start_ssl3_connect_~s__state~4 4432) .cse0) (and (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~4) .cse1))) [2018-09-26 21:53:55,173 INFO L202 PluginConnector]: Adding new model s3_clnt_2.cil.c_21.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 09:53:55 BoogieIcfgContainer [2018-09-26 21:53:55,173 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 21:53:55,174 INFO L168 Benchmark]: Toolchain (without parser) took 20052.40 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 104.3 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 69.5 MB). Peak memory consumption was 585.9 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:55,176 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.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-09-26 21:53:55,177 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.56 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-09-26 21:53:55,177 INFO L168 Benchmark]: Boogie Preprocessor took 37.11 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-09-26 21:53:55,178 INFO L168 Benchmark]: RCFGBuilder took 798.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:55,179 INFO L168 Benchmark]: TraceAbstraction took 19154.53 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 104.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.8 MB). Peak memory consumption was 554.2 MB. Max. memory is 7.1 GB. [2018-09-26 21:53:55,184 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.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. * Boogie Procedure Inliner took 55.56 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 37.11 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 798.84 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 19154.53 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 104.3 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 37.8 MB). Peak memory consumption was 554.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 459]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 319]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 313]: Loop Invariant Derived loop invariant: (((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 419]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 <= 4432 && 4432 <= ssl3_connect_~s__state~4)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 289]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 404]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 4 && ssl3_connect_~s__state~4 == 4416 - InvariantResult [Line: 332]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4448) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368 - InvariantResult [Line: 394]: Loop Invariant Derived loop invariant: (((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 348]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384 - InvariantResult [Line: 415]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 <= 4432 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: ((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4480)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 266]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400) || (ssl3_connect_~s__state~4 == 4400 && ssl3_connect_~blastFlag~4 == 3) - InvariantResult [Line: 499]: Loop Invariant Derived loop invariant: (((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || ((ssl3_connect_~s__state~4 <= 4528 && 4432 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (4432 <= ssl3_connect_~s__state~4 && ssl3_connect_~s__state~4 <= 4512)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) - InvariantResult [Line: 261]: Loop Invariant Derived loop invariant: ((((((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 12292)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4368)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4384)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && ssl3_connect_~s__state~4 <= 4560) && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || ((ssl3_connect_~blastFlag~4 <= 2 && 4560 <= ssl3_connect_~s__state~4) && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 390]: Loop Invariant Derived loop invariant: (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 336]: Loop Invariant Derived loop invariant: ((((((ssl3_connect_~s__state~4 <= 4528 && ssl3_connect_~blastFlag~4 <= 4) && 4432 <= ssl3_connect_~s__state~4) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400)) || ((ssl3_connect_~s__s3__tmp__next_state___0~4 <= 4560 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4) && ssl3_connect_~s__state~4 <= 4352)) || (ssl3_connect_~s__state~4 == 4416 && ssl3_connect_~blastFlag~4 == 3)) || (4560 <= ssl3_connect_~s__state~4 && 4560 <= ssl3_connect_~s__s3__tmp__next_state___0~4)) || (ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4416) - InvariantResult [Line: 357]: Loop Invariant Derived loop invariant: ssl3_connect_~blastFlag~4 <= 2 && ssl3_connect_~s__state~4 == 4400 - InvariantResult [Line: 431]: Loop Invariant Derived loop invariant: false - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. SAFE Result, 19.0s OverallTime, 17 OverallIterations, 17 TraceHistogramMax, 10.5s AutomataDifference, 0.0s DeadEndRemovalTime, 4.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 545 SDtfs, 240 SDslu, 220 SDs, 0 SdLazy, 533 SolverSat, 139 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 327 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=318occurred 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, 17 MinimizatonAttempts, 165 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 253 NumberOfFragments, 713 HoareAnnotationTreeSize, 22 FomulaSimplifications, 6566 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 22 FomulaSimplificationsInter, 1150 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1452 NumberOfCodeBlocks, 1452 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1433 ConstructedInterpolants, 0 QuantifiedInterpolants, 173573 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1255 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 19 InterpolantComputations, 15 PerfectInterpolantSequences, 5594/5608 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_21-53-55-207.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/s3_clnt_2.cil.c_21.bpl_svcomp-Reach-32bit-Automizer_Default_PUPT.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_21-53-55-207.csv Received shutdown request...