java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 02:10:40,005 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:10:40,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:10:40,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:10:40,015 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:10:40,016 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:10:40,016 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:10:40,017 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:10:40,018 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:10:40,019 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:10:40,019 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:10:40,019 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:10:40,020 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:10:40,021 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:10:40,021 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:10:40,022 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:10:40,023 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:10:40,024 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:10:40,025 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:10:40,025 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:10:40,027 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:10:40,027 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:10:40,027 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:10:40,027 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:10:40,028 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:10:40,028 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:10:40,029 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:10:40,029 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:10:40,029 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:10:40,029 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:10:40,029 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:10:40,030 INFO L98 SettingsManager]: Beginning loading settings from /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 02:10:40,034 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:10:40,035 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:10:40,035 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:10:40,035 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:10:40,035 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:10:40,035 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:10:40,035 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:10:40,036 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:10:40,036 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 02:10:40,037 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:10:40,037 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:10:40,037 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:10:40,038 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:10:40,038 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:10:40,038 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:10:40,038 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:10:40,038 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:10:40,038 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:10:40,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:10:40,063 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:10:40,065 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:10:40,065 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:10:40,066 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:10:40,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-01-30 02:10:40,192 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:10:40,193 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 02:10:40,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:10:40,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:10:40,201 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:10:40,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31219e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40, skipping insertion in model container [2018-01-30 02:10:40,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,212 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:10:40,263 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:10:40,437 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:10:40,485 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:10:40,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40 WrapperNode [2018-01-30 02:10:40,495 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:10:40,496 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:10:40,496 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:10:40,496 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:10:40,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,506 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,530 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... [2018-01-30 02:10:40,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:10:40,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:10:40,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:10:40,536 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:10:40,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (1/1) ... No working directory specified, using /home/daniel/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-01-30 02:10:40,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:10:40,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:10:40,570 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:10:40,570 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_connect [2018-01-30 02:10:40,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:10:40,570 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:10:40,570 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_connect [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:10:40,571 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:10:40,861 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 02:10:40,861 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 02:10:41,995 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:10:41,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:10:41 BoogieIcfgContainer [2018-01-30 02:10:41,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:10:41,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:10:41,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:10:41,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:10:41,998 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:10:40" (1/3) ... [2018-01-30 02:10:41,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb40a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:10:41, skipping insertion in model container [2018-01-30 02:10:41,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:10:40" (2/3) ... [2018-01-30 02:10:41,999 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb40a8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:10:41, skipping insertion in model container [2018-01-30 02:10:41,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:10:41" (3/3) ... [2018-01-30 02:10:42,000 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_clnt.blast.01_true-unreach-call.i.cil.c [2018-01-30 02:10:42,005 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:10:42,010 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 02:10:42,039 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:10:42,039 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:10:42,039 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:10:42,040 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:10:42,040 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:10:42,040 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:10:42,040 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:10:42,040 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:10:42,040 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:10:42,054 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states. [2018-01-30 02:10:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-01-30 02:10:42,062 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:42,063 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:42,063 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:42,066 INFO L82 PathProgramCache]: Analyzing trace with hash -574540261, now seen corresponding path program 1 times [2018-01-30 02:10:42,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:42,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:42,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:42,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:42,099 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:42,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:42,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:10:42,388 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:42,388 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:10:42,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:10:42,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:10:42,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:42,399 INFO L87 Difference]: Start difference. First operand 566 states. Second operand 3 states. [2018-01-30 02:10:42,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:42,638 INFO L93 Difference]: Finished difference Result 1510 states and 1762 transitions. [2018-01-30 02:10:42,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:10:42,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2018-01-30 02:10:42,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:42,654 INFO L225 Difference]: With dead ends: 1510 [2018-01-30 02:10:42,654 INFO L226 Difference]: Without dead ends: 913 [2018-01-30 02:10:42,658 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:42,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-01-30 02:10:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2018-01-30 02:10:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-01-30 02:10:42,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1017 transitions. [2018-01-30 02:10:42,710 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1017 transitions. Word has length 120 [2018-01-30 02:10:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:42,711 INFO L432 AbstractCegarLoop]: Abstraction has 913 states and 1017 transitions. [2018-01-30 02:10:42,711 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:10:42,711 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1017 transitions. [2018-01-30 02:10:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-01-30 02:10:42,715 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:42,715 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:42,716 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:42,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1106963413, now seen corresponding path program 1 times [2018-01-30 02:10:42,716 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:42,716 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:42,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:42,717 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:42,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:42,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:42,745 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:42,984 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:10:42,984 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:42,984 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:42,986 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:42,986 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:42,986 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:42,986 INFO L87 Difference]: Start difference. First operand 913 states and 1017 transitions. Second operand 4 states. [2018-01-30 02:10:43,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:43,637 INFO L93 Difference]: Finished difference Result 1445 states and 1620 transitions. [2018-01-30 02:10:43,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:10:43,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2018-01-30 02:10:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:43,646 INFO L225 Difference]: With dead ends: 1445 [2018-01-30 02:10:43,647 INFO L226 Difference]: Without dead ends: 1021 [2018-01-30 02:10:43,648 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:43,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2018-01-30 02:10:43,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 962. [2018-01-30 02:10:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2018-01-30 02:10:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1078 transitions. [2018-01-30 02:10:43,675 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1078 transitions. Word has length 163 [2018-01-30 02:10:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:43,679 INFO L432 AbstractCegarLoop]: Abstraction has 962 states and 1078 transitions. [2018-01-30 02:10:43,679 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1078 transitions. [2018-01-30 02:10:43,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-01-30 02:10:43,683 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:43,684 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:43,684 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:43,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1025634150, now seen corresponding path program 1 times [2018-01-30 02:10:43,684 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:43,684 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:43,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:43,685 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:43,685 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:43,703 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:10:43,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:43,792 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:10:43,792 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:10:43,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:10:43,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:43,793 INFO L87 Difference]: Start difference. First operand 962 states and 1078 transitions. Second operand 3 states. [2018-01-30 02:10:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:43,942 INFO L93 Difference]: Finished difference Result 1893 states and 2139 transitions. [2018-01-30 02:10:43,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:10:43,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 176 [2018-01-30 02:10:43,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:43,953 INFO L225 Difference]: With dead ends: 1893 [2018-01-30 02:10:43,953 INFO L226 Difference]: Without dead ends: 1420 [2018-01-30 02:10:43,954 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:43,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2018-01-30 02:10:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 1420. [2018-01-30 02:10:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1420 states. [2018-01-30 02:10:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1420 states to 1420 states and 1595 transitions. [2018-01-30 02:10:43,971 INFO L78 Accepts]: Start accepts. Automaton has 1420 states and 1595 transitions. Word has length 176 [2018-01-30 02:10:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:43,972 INFO L432 AbstractCegarLoop]: Abstraction has 1420 states and 1595 transitions. [2018-01-30 02:10:43,972 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:10:43,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1420 states and 1595 transitions. [2018-01-30 02:10:43,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-01-30 02:10:43,975 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:43,976 INFO L350 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:43,976 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:43,976 INFO L82 PathProgramCache]: Analyzing trace with hash 970952208, now seen corresponding path program 1 times [2018-01-30 02:10:43,976 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:43,976 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:43,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:43,977 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:43,977 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:44,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:44,007 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-30 02:10:44,151 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:44,151 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:10:44,151 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:10:44,152 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:10:44,152 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:44,152 INFO L87 Difference]: Start difference. First operand 1420 states and 1595 transitions. Second operand 3 states. [2018-01-30 02:10:44,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:44,456 INFO L93 Difference]: Finished difference Result 2817 states and 3182 transitions. [2018-01-30 02:10:44,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:10:44,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2018-01-30 02:10:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:44,461 INFO L225 Difference]: With dead ends: 2817 [2018-01-30 02:10:44,461 INFO L226 Difference]: Without dead ends: 1886 [2018-01-30 02:10:44,462 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:44,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1886 states. [2018-01-30 02:10:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1886 to 1886. [2018-01-30 02:10:44,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1886 states. [2018-01-30 02:10:44,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1886 states to 1886 states and 2124 transitions. [2018-01-30 02:10:44,483 INFO L78 Accepts]: Start accepts. Automaton has 1886 states and 2124 transitions. Word has length 209 [2018-01-30 02:10:44,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:44,483 INFO L432 AbstractCegarLoop]: Abstraction has 1886 states and 2124 transitions. [2018-01-30 02:10:44,484 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:10:44,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1886 states and 2124 transitions. [2018-01-30 02:10:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-30 02:10:44,486 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:44,487 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:44,487 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:44,487 INFO L82 PathProgramCache]: Analyzing trace with hash -462676305, now seen corresponding path program 1 times [2018-01-30 02:10:44,487 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:44,487 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:44,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:44,488 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:44,488 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:44,521 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:44,846 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-01-30 02:10:44,847 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:44,847 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:44,847 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:44,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:44,847 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:44,847 INFO L87 Difference]: Start difference. First operand 1886 states and 2124 transitions. Second operand 4 states. [2018-01-30 02:10:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:46,401 INFO L93 Difference]: Finished difference Result 4624 states and 5236 transitions. [2018-01-30 02:10:46,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:46,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-01-30 02:10:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:46,407 INFO L225 Difference]: With dead ends: 4624 [2018-01-30 02:10:46,407 INFO L226 Difference]: Without dead ends: 2820 [2018-01-30 02:10:46,409 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:46,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2018-01-30 02:10:46,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2054. [2018-01-30 02:10:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2018-01-30 02:10:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 2334 transitions. [2018-01-30 02:10:46,434 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 2334 transitions. Word has length 265 [2018-01-30 02:10:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:46,434 INFO L432 AbstractCegarLoop]: Abstraction has 2054 states and 2334 transitions. [2018-01-30 02:10:46,434 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 2334 transitions. [2018-01-30 02:10:46,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-01-30 02:10:46,437 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:46,438 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:46,438 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:46,438 INFO L82 PathProgramCache]: Analyzing trace with hash 333015211, now seen corresponding path program 1 times [2018-01-30 02:10:46,438 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:46,438 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:46,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:46,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:46,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:46,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:46,802 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:46,802 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:46,802 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:46,803 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:46,803 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:46,803 INFO L87 Difference]: Start difference. First operand 2054 states and 2334 transitions. Second operand 4 states. [2018-01-30 02:10:47,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:47,134 INFO L93 Difference]: Finished difference Result 4601 states and 5247 transitions. [2018-01-30 02:10:47,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:10:47,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 265 [2018-01-30 02:10:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:47,147 INFO L225 Difference]: With dead ends: 4601 [2018-01-30 02:10:47,147 INFO L226 Difference]: Without dead ends: 2629 [2018-01-30 02:10:47,149 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2629 states. [2018-01-30 02:10:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2629 to 2298. [2018-01-30 02:10:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2298 states. [2018-01-30 02:10:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2298 states to 2298 states and 2642 transitions. [2018-01-30 02:10:47,175 INFO L78 Accepts]: Start accepts. Automaton has 2298 states and 2642 transitions. Word has length 265 [2018-01-30 02:10:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:47,175 INFO L432 AbstractCegarLoop]: Abstraction has 2298 states and 2642 transitions. [2018-01-30 02:10:47,175 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 2298 states and 2642 transitions. [2018-01-30 02:10:47,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-01-30 02:10:47,179 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:47,179 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:47,179 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:47,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1260721434, now seen corresponding path program 1 times [2018-01-30 02:10:47,179 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:47,179 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:47,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:47,180 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:47,180 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:47,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:47,887 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:47,887 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:47,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:10:47,887 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:10:47,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:10:47,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:10:47,888 INFO L87 Difference]: Start difference. First operand 2298 states and 2642 transitions. Second operand 6 states. [2018-01-30 02:10:49,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:49,026 INFO L93 Difference]: Finished difference Result 7540 states and 8656 transitions. [2018-01-30 02:10:49,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:10:49,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 278 [2018-01-30 02:10:49,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:49,035 INFO L225 Difference]: With dead ends: 7540 [2018-01-30 02:10:49,035 INFO L226 Difference]: Without dead ends: 5324 [2018-01-30 02:10:49,039 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:10:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5324 states. [2018-01-30 02:10:49,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5324 to 2322. [2018-01-30 02:10:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2322 states. [2018-01-30 02:10:49,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 2666 transitions. [2018-01-30 02:10:49,072 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 2666 transitions. Word has length 278 [2018-01-30 02:10:49,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:49,072 INFO L432 AbstractCegarLoop]: Abstraction has 2322 states and 2666 transitions. [2018-01-30 02:10:49,072 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:10:49,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 2666 transitions. [2018-01-30 02:10:49,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-01-30 02:10:49,076 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:49,076 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:49,076 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:49,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1892252742, now seen corresponding path program 1 times [2018-01-30 02:10:49,077 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:49,077 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:49,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:49,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:49,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:49,091 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:49,395 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:49,395 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:49,395 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:49,395 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:49,396 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:49,396 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:49,396 INFO L87 Difference]: Start difference. First operand 2322 states and 2666 transitions. Second operand 4 states. [2018-01-30 02:10:49,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:49,694 INFO L93 Difference]: Finished difference Result 5033 states and 5783 transitions. [2018-01-30 02:10:49,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:49,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2018-01-30 02:10:49,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:49,702 INFO L225 Difference]: With dead ends: 5033 [2018-01-30 02:10:49,702 INFO L226 Difference]: Without dead ends: 2793 [2018-01-30 02:10:49,705 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2793 states. [2018-01-30 02:10:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2793 to 2366. [2018-01-30 02:10:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2018-01-30 02:10:49,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2714 transitions. [2018-01-30 02:10:49,730 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2714 transitions. Word has length 306 [2018-01-30 02:10:49,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:49,731 INFO L432 AbstractCegarLoop]: Abstraction has 2366 states and 2714 transitions. [2018-01-30 02:10:49,731 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:49,731 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2714 transitions. [2018-01-30 02:10:49,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-01-30 02:10:49,735 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:49,735 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:49,735 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1417478148, now seen corresponding path program 1 times [2018-01-30 02:10:49,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:49,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:49,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:49,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:49,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:49,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:49,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:50,120 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:50,121 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:50,121 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:50,121 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:50,121 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:50,121 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:50,121 INFO L87 Difference]: Start difference. First operand 2366 states and 2714 transitions. Second operand 4 states. [2018-01-30 02:10:50,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:50,608 INFO L93 Difference]: Finished difference Result 5073 states and 5823 transitions. [2018-01-30 02:10:50,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:50,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2018-01-30 02:10:50,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:50,613 INFO L225 Difference]: With dead ends: 5073 [2018-01-30 02:10:50,613 INFO L226 Difference]: Without dead ends: 2789 [2018-01-30 02:10:50,615 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2789 states. [2018-01-30 02:10:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2789 to 2378. [2018-01-30 02:10:50,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-01-30 02:10:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 2726 transitions. [2018-01-30 02:10:50,639 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 2726 transitions. Word has length 309 [2018-01-30 02:10:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:50,640 INFO L432 AbstractCegarLoop]: Abstraction has 2378 states and 2726 transitions. [2018-01-30 02:10:50,640 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2726 transitions. [2018-01-30 02:10:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-01-30 02:10:50,642 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:50,642 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:50,642 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:50,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1662204330, now seen corresponding path program 1 times [2018-01-30 02:10:50,643 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:50,643 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:50,643 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:50,644 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:50,644 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:50,656 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:50,827 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:50,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:50,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:50,827 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:50,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:50,827 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:50,827 INFO L87 Difference]: Start difference. First operand 2378 states and 2726 transitions. Second operand 4 states. [2018-01-30 02:10:51,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:51,123 INFO L93 Difference]: Finished difference Result 5073 states and 5819 transitions. [2018-01-30 02:10:51,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:51,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2018-01-30 02:10:51,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:51,130 INFO L225 Difference]: With dead ends: 5073 [2018-01-30 02:10:51,130 INFO L226 Difference]: Without dead ends: 2777 [2018-01-30 02:10:51,132 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:51,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2018-01-30 02:10:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2378. [2018-01-30 02:10:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2018-01-30 02:10:51,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 2722 transitions. [2018-01-30 02:10:51,157 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 2722 transitions. Word has length 310 [2018-01-30 02:10:51,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:51,157 INFO L432 AbstractCegarLoop]: Abstraction has 2378 states and 2722 transitions. [2018-01-30 02:10:51,157 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:51,157 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 2722 transitions. [2018-01-30 02:10:51,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-01-30 02:10:51,160 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:51,160 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:51,160 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:51,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1567983991, now seen corresponding path program 1 times [2018-01-30 02:10:51,160 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:51,160 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:51,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:51,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:51,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:51,174 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:51,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:51,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:51,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:51,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:51,354 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:51,355 INFO L87 Difference]: Start difference. First operand 2378 states and 2722 transitions. Second operand 4 states. [2018-01-30 02:10:51,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:51,569 INFO L93 Difference]: Finished difference Result 5069 states and 5807 transitions. [2018-01-30 02:10:51,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:51,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 310 [2018-01-30 02:10:51,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:51,574 INFO L225 Difference]: With dead ends: 5069 [2018-01-30 02:10:51,574 INFO L226 Difference]: Without dead ends: 2773 [2018-01-30 02:10:51,576 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:51,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2018-01-30 02:10:51,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2438. [2018-01-30 02:10:51,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2018-01-30 02:10:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 2798 transitions. [2018-01-30 02:10:51,600 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 2798 transitions. Word has length 310 [2018-01-30 02:10:51,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:51,600 INFO L432 AbstractCegarLoop]: Abstraction has 2438 states and 2798 transitions. [2018-01-30 02:10:51,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2798 transitions. [2018-01-30 02:10:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-01-30 02:10:51,603 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:51,603 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:51,603 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:51,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1728718990, now seen corresponding path program 1 times [2018-01-30 02:10:51,603 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:51,603 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:51,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:51,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:51,604 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:51,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:51,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:51,900 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:51,900 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:51,900 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:51,900 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:51,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:51,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:51,901 INFO L87 Difference]: Start difference. First operand 2438 states and 2798 transitions. Second operand 4 states. [2018-01-30 02:10:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:52,361 INFO L93 Difference]: Finished difference Result 5125 states and 5875 transitions. [2018-01-30 02:10:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:52,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 312 [2018-01-30 02:10:52,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:52,366 INFO L225 Difference]: With dead ends: 5125 [2018-01-30 02:10:52,366 INFO L226 Difference]: Without dead ends: 2769 [2018-01-30 02:10:52,368 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2769 states. [2018-01-30 02:10:52,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2769 to 2438. [2018-01-30 02:10:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2438 states. [2018-01-30 02:10:52,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2438 states to 2438 states and 2794 transitions. [2018-01-30 02:10:52,392 INFO L78 Accepts]: Start accepts. Automaton has 2438 states and 2794 transitions. Word has length 312 [2018-01-30 02:10:52,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:52,392 INFO L432 AbstractCegarLoop]: Abstraction has 2438 states and 2794 transitions. [2018-01-30 02:10:52,392 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2438 states and 2794 transitions. [2018-01-30 02:10:52,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-01-30 02:10:52,395 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:52,395 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:52,395 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:52,395 INFO L82 PathProgramCache]: Analyzing trace with hash -980650937, now seen corresponding path program 1 times [2018-01-30 02:10:52,395 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:52,395 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:52,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:52,396 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:52,396 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:52,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:52,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:52,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:52,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:52,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:52,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:52,620 INFO L87 Difference]: Start difference. First operand 2438 states and 2794 transitions. Second operand 4 states. [2018-01-30 02:10:52,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:52,814 INFO L93 Difference]: Finished difference Result 5083 states and 5820 transitions. [2018-01-30 02:10:52,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:52,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 313 [2018-01-30 02:10:52,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:52,817 INFO L225 Difference]: With dead ends: 5083 [2018-01-30 02:10:52,817 INFO L226 Difference]: Without dead ends: 2727 [2018-01-30 02:10:52,822 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:52,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2018-01-30 02:10:52,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2450. [2018-01-30 02:10:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2806 transitions. [2018-01-30 02:10:52,843 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2806 transitions. Word has length 313 [2018-01-30 02:10:52,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:52,843 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2806 transitions. [2018-01-30 02:10:52,843 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:52,843 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2806 transitions. [2018-01-30 02:10:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-01-30 02:10:52,846 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:52,846 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:52,846 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:52,846 INFO L82 PathProgramCache]: Analyzing trace with hash 2064115916, now seen corresponding path program 1 times [2018-01-30 02:10:52,846 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:52,846 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:52,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:52,847 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:52,847 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:52,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:52,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:53,007 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:53,007 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:53,007 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:53,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:53,008 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:53,008 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:53,008 INFO L87 Difference]: Start difference. First operand 2450 states and 2806 transitions. Second operand 4 states. [2018-01-30 02:10:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:53,199 INFO L93 Difference]: Finished difference Result 4995 states and 5720 transitions. [2018-01-30 02:10:53,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:53,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2018-01-30 02:10:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:53,212 INFO L225 Difference]: With dead ends: 4995 [2018-01-30 02:10:53,212 INFO L226 Difference]: Without dead ends: 2627 [2018-01-30 02:10:53,214 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:53,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2627 states. [2018-01-30 02:10:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2627 to 2450. [2018-01-30 02:10:53,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:53,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2802 transitions. [2018-01-30 02:10:53,235 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2802 transitions. Word has length 315 [2018-01-30 02:10:53,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:53,235 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2802 transitions. [2018-01-30 02:10:53,235 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:53,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2802 transitions. [2018-01-30 02:10:53,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-01-30 02:10:53,238 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:53,238 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:53,238 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:53,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1043691627, now seen corresponding path program 1 times [2018-01-30 02:10:53,239 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:53,239 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:53,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:53,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:53,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:53,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:53,481 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:53,481 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:53,482 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:10:53,482 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:10:53,482 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:10:53,482 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:10:53,482 INFO L87 Difference]: Start difference. First operand 2450 states and 2802 transitions. Second operand 6 states. [2018-01-30 02:10:54,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:54,023 INFO L93 Difference]: Finished difference Result 7482 states and 8525 transitions. [2018-01-30 02:10:54,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:10:54,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 319 [2018-01-30 02:10:54,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:54,028 INFO L225 Difference]: With dead ends: 7482 [2018-01-30 02:10:54,028 INFO L226 Difference]: Without dead ends: 5114 [2018-01-30 02:10:54,031 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:10:54,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2018-01-30 02:10:54,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 2450. [2018-01-30 02:10:54,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:54,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2798 transitions. [2018-01-30 02:10:54,087 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2798 transitions. Word has length 319 [2018-01-30 02:10:54,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:54,088 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2798 transitions. [2018-01-30 02:10:54,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:10:54,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2798 transitions. [2018-01-30 02:10:54,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-01-30 02:10:54,090 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:54,090 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:54,090 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:54,090 INFO L82 PathProgramCache]: Analyzing trace with hash 975297781, now seen corresponding path program 1 times [2018-01-30 02:10:54,090 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:54,090 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:54,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:54,091 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:54,091 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:54,104 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:54,304 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:54,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:54,306 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:54,307 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:54,307 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:54,307 INFO L87 Difference]: Start difference. First operand 2450 states and 2798 transitions. Second operand 4 states. [2018-01-30 02:10:54,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:54,478 INFO L93 Difference]: Finished difference Result 4435 states and 5066 transitions. [2018-01-30 02:10:54,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:54,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 320 [2018-01-30 02:10:54,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:54,481 INFO L225 Difference]: With dead ends: 4435 [2018-01-30 02:10:54,481 INFO L226 Difference]: Without dead ends: 2623 [2018-01-30 02:10:54,482 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:54,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2623 states. [2018-01-30 02:10:54,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2623 to 2450. [2018-01-30 02:10:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:54,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2794 transitions. [2018-01-30 02:10:54,503 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2794 transitions. Word has length 320 [2018-01-30 02:10:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:54,503 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2794 transitions. [2018-01-30 02:10:54,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2794 transitions. [2018-01-30 02:10:54,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:10:54,506 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:54,506 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:54,506 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:54,506 INFO L82 PathProgramCache]: Analyzing trace with hash 2110805439, now seen corresponding path program 1 times [2018-01-30 02:10:54,506 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:54,506 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:54,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:54,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:54,507 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:54,518 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:54,759 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:54,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:54,759 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:10:54,759 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:10:54,759 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:10:54,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:10:54,760 INFO L87 Difference]: Start difference. First operand 2450 states and 2794 transitions. Second operand 6 states. [2018-01-30 02:10:55,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:55,268 INFO L93 Difference]: Finished difference Result 7474 states and 8497 transitions. [2018-01-30 02:10:55,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:10:55,269 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 322 [2018-01-30 02:10:55,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:55,273 INFO L225 Difference]: With dead ends: 7474 [2018-01-30 02:10:55,274 INFO L226 Difference]: Without dead ends: 5106 [2018-01-30 02:10:55,276 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:10:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2018-01-30 02:10:55,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 2450. [2018-01-30 02:10:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2790 transitions. [2018-01-30 02:10:55,304 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2790 transitions. Word has length 322 [2018-01-30 02:10:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:55,305 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2790 transitions. [2018-01-30 02:10:55,305 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:10:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2790 transitions. [2018-01-30 02:10:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:10:55,307 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:55,307 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:55,307 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1204403661, now seen corresponding path program 1 times [2018-01-30 02:10:55,307 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:55,307 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:55,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:55,308 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:55,308 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:55,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:55,604 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:55,605 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:55,605 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:55,605 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:55,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:55,605 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:55,605 INFO L87 Difference]: Start difference. First operand 2450 states and 2790 transitions. Second operand 4 states. [2018-01-30 02:10:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:55,749 INFO L93 Difference]: Finished difference Result 4404 states and 5019 transitions. [2018-01-30 02:10:55,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:10:55,749 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 323 [2018-01-30 02:10:55,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:55,751 INFO L225 Difference]: With dead ends: 4404 [2018-01-30 02:10:55,751 INFO L226 Difference]: Without dead ends: 2592 [2018-01-30 02:10:55,752 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2592 states. [2018-01-30 02:10:55,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2592 to 2450. [2018-01-30 02:10:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2018-01-30 02:10:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 2786 transitions. [2018-01-30 02:10:55,775 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 2786 transitions. Word has length 323 [2018-01-30 02:10:55,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:55,775 INFO L432 AbstractCegarLoop]: Abstraction has 2450 states and 2786 transitions. [2018-01-30 02:10:55,775 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:55,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 2786 transitions. [2018-01-30 02:10:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-01-30 02:10:55,777 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:55,778 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:55,778 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:55,778 INFO L82 PathProgramCache]: Analyzing trace with hash 726270019, now seen corresponding path program 1 times [2018-01-30 02:10:55,778 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:55,778 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:55,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:55,779 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:55,779 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:55,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-01-30 02:10:55,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:55,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:10:55,891 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:10:55,891 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:10:55,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:55,892 INFO L87 Difference]: Start difference. First operand 2450 states and 2786 transitions. Second operand 3 states. [2018-01-30 02:10:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:56,179 INFO L93 Difference]: Finished difference Result 4870 states and 5557 transitions. [2018-01-30 02:10:56,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:10:56,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 323 [2018-01-30 02:10:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:56,181 INFO L225 Difference]: With dead ends: 4870 [2018-01-30 02:10:56,181 INFO L226 Difference]: Without dead ends: 3064 [2018-01-30 02:10:56,183 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:56,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3064 states. [2018-01-30 02:10:56,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3064 to 3064. [2018-01-30 02:10:56,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3064 states. [2018-01-30 02:10:56,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 3488 transitions. [2018-01-30 02:10:56,208 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 3488 transitions. Word has length 323 [2018-01-30 02:10:56,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:56,208 INFO L432 AbstractCegarLoop]: Abstraction has 3064 states and 3488 transitions. [2018-01-30 02:10:56,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:10:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 3488 transitions. [2018-01-30 02:10:56,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-01-30 02:10:56,210 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:56,211 INFO L350 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:56,211 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:56,211 INFO L82 PathProgramCache]: Analyzing trace with hash 973123262, now seen corresponding path program 1 times [2018-01-30 02:10:56,211 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:56,211 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:56,212 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:56,213 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:56,213 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:56,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:56,228 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:10:56,338 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:56,338 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:10:56,338 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:10:56,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:10:56,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:56,338 INFO L87 Difference]: Start difference. First operand 3064 states and 3488 transitions. Second operand 3 states. [2018-01-30 02:10:56,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:56,536 INFO L93 Difference]: Finished difference Result 3687 states and 4204 transitions. [2018-01-30 02:10:56,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:10:56,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 324 [2018-01-30 02:10:56,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:56,538 INFO L225 Difference]: With dead ends: 3687 [2018-01-30 02:10:56,538 INFO L226 Difference]: Without dead ends: 3685 [2018-01-30 02:10:56,539 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:10:56,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3685 states. [2018-01-30 02:10:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3685 to 3685. [2018-01-30 02:10:56,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3685 states. [2018-01-30 02:10:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3685 states to 3685 states and 4202 transitions. [2018-01-30 02:10:56,569 INFO L78 Accepts]: Start accepts. Automaton has 3685 states and 4202 transitions. Word has length 324 [2018-01-30 02:10:56,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:56,569 INFO L432 AbstractCegarLoop]: Abstraction has 3685 states and 4202 transitions. [2018-01-30 02:10:56,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:10:56,569 INFO L276 IsEmpty]: Start isEmpty. Operand 3685 states and 4202 transitions. [2018-01-30 02:10:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 397 [2018-01-30 02:10:56,572 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:56,573 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:56,573 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:56,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2109197968, now seen corresponding path program 1 times [2018-01-30 02:10:56,573 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:56,573 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:56,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:56,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:56,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:56,587 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:56,891 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:10:56,891 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:56,891 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:10:56,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:10:56,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:10:56,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:10:56,892 INFO L87 Difference]: Start difference. First operand 3685 states and 4202 transitions. Second operand 4 states. [2018-01-30 02:10:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:57,103 INFO L93 Difference]: Finished difference Result 8082 states and 9237 transitions. [2018-01-30 02:10:57,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:10:57,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 396 [2018-01-30 02:10:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:57,106 INFO L225 Difference]: With dead ends: 8082 [2018-01-30 02:10:57,106 INFO L226 Difference]: Without dead ends: 4479 [2018-01-30 02:10:57,109 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:10:57,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4479 states. [2018-01-30 02:10:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4479 to 4020. [2018-01-30 02:10:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4020 states. [2018-01-30 02:10:57,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 4627 transitions. [2018-01-30 02:10:57,141 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 4627 transitions. Word has length 396 [2018-01-30 02:10:57,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:57,141 INFO L432 AbstractCegarLoop]: Abstraction has 4020 states and 4627 transitions. [2018-01-30 02:10:57,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:10:57,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 4627 transitions. [2018-01-30 02:10:57,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-01-30 02:10:57,144 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:57,145 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:57,145 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:57,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1702170267, now seen corresponding path program 1 times [2018-01-30 02:10:57,145 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:57,145 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:57,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:57,146 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:57,146 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:57,160 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2018-01-30 02:10:57,598 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:10:57,598 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:10:57,599 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:10:57,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:10:57,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:10:57,599 INFO L87 Difference]: Start difference. First operand 4020 states and 4627 transitions. Second operand 6 states. [2018-01-30 02:10:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:10:58,108 INFO L93 Difference]: Finished difference Result 12329 states and 14157 transitions. [2018-01-30 02:10:58,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:10:58,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 409 [2018-01-30 02:10:58,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:10:58,113 INFO L225 Difference]: With dead ends: 12329 [2018-01-30 02:10:58,113 INFO L226 Difference]: Without dead ends: 8391 [2018-01-30 02:10:58,117 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:10:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8391 states. [2018-01-30 02:10:58,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8391 to 4050. [2018-01-30 02:10:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4050 states. [2018-01-30 02:10:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 4657 transitions. [2018-01-30 02:10:58,160 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 4657 transitions. Word has length 409 [2018-01-30 02:10:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:10:58,161 INFO L432 AbstractCegarLoop]: Abstraction has 4050 states and 4657 transitions. [2018-01-30 02:10:58,161 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:10:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 4657 transitions. [2018-01-30 02:10:58,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-01-30 02:10:58,164 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:10:58,164 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:10:58,164 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:10:58,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1212325189, now seen corresponding path program 1 times [2018-01-30 02:10:58,164 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:10:58,164 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:10:58,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:58,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:58,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:10:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:58,181 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:10:58,568 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 374 proven. 36 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-01-30 02:10:58,569 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:10:58,569 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-01-30 02:10:58,575 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:10:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:10:58,660 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:10:58,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:10:58,752 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:10:58,752 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:10:58,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:10:58,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:10:58,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:10:58,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:10:58,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:58,953 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:10:59,006 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:10:59,031 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:10:59,039 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:10:59,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:10:59,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:10:59,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:59,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:10:59,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:10:59,110 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 374 proven. 0 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-01-30 02:10:59,129 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:10:59,129 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-01-30 02:10:59,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:10:59,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:10:59,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:10:59,130 INFO L87 Difference]: Start difference. First operand 4050 states and 4657 transitions. Second operand 7 states. [2018-01-30 02:11:00,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:00,758 INFO L93 Difference]: Finished difference Result 10585 states and 12178 transitions. [2018-01-30 02:11:00,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:11:00,765 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 437 [2018-01-30 02:11:00,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:00,775 INFO L225 Difference]: With dead ends: 10585 [2018-01-30 02:11:00,775 INFO L226 Difference]: Without dead ends: 6617 [2018-01-30 02:11:00,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 438 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:11:00,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-01-30 02:11:00,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 4507. [2018-01-30 02:11:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4507 states. [2018-01-30 02:11:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4507 states to 4507 states and 5227 transitions. [2018-01-30 02:11:00,919 INFO L78 Accepts]: Start accepts. Automaton has 4507 states and 5227 transitions. Word has length 437 [2018-01-30 02:11:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:00,919 INFO L432 AbstractCegarLoop]: Abstraction has 4507 states and 5227 transitions. [2018-01-30 02:11:00,919 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:11:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 4507 states and 5227 transitions. [2018-01-30 02:11:00,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2018-01-30 02:11:00,925 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:00,925 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:00,925 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:00,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1124041167, now seen corresponding path program 1 times [2018-01-30 02:11:00,925 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:00,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:00,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:00,926 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:00,926 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:00,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:00,945 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:01,354 INFO L134 CoverageAnalysis]: Checked inductivity of 621 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-30 02:11:01,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:01,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:01,354 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:01,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:01,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:01,355 INFO L87 Difference]: Start difference. First operand 4507 states and 5227 transitions. Second operand 4 states. [2018-01-30 02:11:01,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:01,784 INFO L93 Difference]: Finished difference Result 9536 states and 11057 transitions. [2018-01-30 02:11:01,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:01,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 443 [2018-01-30 02:11:01,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:01,790 INFO L225 Difference]: With dead ends: 9536 [2018-01-30 02:11:01,791 INFO L226 Difference]: Without dead ends: 5111 [2018-01-30 02:11:01,796 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:01,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5111 states. [2018-01-30 02:11:01,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5111 to 4522. [2018-01-30 02:11:01,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4522 states. [2018-01-30 02:11:01,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 5242 transitions. [2018-01-30 02:11:01,852 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 5242 transitions. Word has length 443 [2018-01-30 02:11:01,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:01,852 INFO L432 AbstractCegarLoop]: Abstraction has 4522 states and 5242 transitions. [2018-01-30 02:11:01,852 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:01,852 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 5242 transitions. [2018-01-30 02:11:01,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-01-30 02:11:01,856 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:01,856 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:01,856 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:01,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2020848879, now seen corresponding path program 1 times [2018-01-30 02:11:01,857 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:01,857 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:01,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:01,857 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:01,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:01,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:01,873 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-30 02:11:02,256 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:02,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:02,257 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:02,257 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:02,257 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:02,257 INFO L87 Difference]: Start difference. First operand 4522 states and 5242 transitions. Second operand 4 states. [2018-01-30 02:11:02,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:02,448 INFO L93 Difference]: Finished difference Result 9536 states and 11052 transitions. [2018-01-30 02:11:02,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:02,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 444 [2018-01-30 02:11:02,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:02,453 INFO L225 Difference]: With dead ends: 9536 [2018-01-30 02:11:02,454 INFO L226 Difference]: Without dead ends: 5096 [2018-01-30 02:11:02,458 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:02,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2018-01-30 02:11:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 4522. [2018-01-30 02:11:02,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4522 states. [2018-01-30 02:11:02,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4522 states to 4522 states and 5237 transitions. [2018-01-30 02:11:02,511 INFO L78 Accepts]: Start accepts. Automaton has 4522 states and 5237 transitions. Word has length 444 [2018-01-30 02:11:02,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:02,511 INFO L432 AbstractCegarLoop]: Abstraction has 4522 states and 5237 transitions. [2018-01-30 02:11:02,511 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:02,511 INFO L276 IsEmpty]: Start isEmpty. Operand 4522 states and 5237 transitions. [2018-01-30 02:11:02,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-01-30 02:11:02,515 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:02,515 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:02,515 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:02,515 INFO L82 PathProgramCache]: Analyzing trace with hash -244351312, now seen corresponding path program 1 times [2018-01-30 02:11:02,515 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:02,516 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:02,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:02,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:02,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:02,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 528 proven. 1 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-01-30 02:11:02,972 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:02,972 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/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-01-30 02:11:02,978 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:03,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:03,041 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:03,081 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:03,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:03,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:03,248 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-01-30 02:11:03,276 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:03,294 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:03,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:03,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-01-30 02:11:03,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:03,629 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:03,648 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:03,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:03,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:03,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 231 proven. 0 refuted. 0 times theorem prover too weak. 483 trivial. 0 not checked. [2018-01-30 02:11:03,896 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:03,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2018-01-30 02:11:03,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 02:11:03,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 02:11:03,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-30 02:11:03,897 INFO L87 Difference]: Start difference. First operand 4522 states and 5237 transitions. Second operand 8 states. [2018-01-30 02:11:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:05,152 INFO L93 Difference]: Finished difference Result 16329 states and 18918 transitions. [2018-01-30 02:11:05,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-30 02:11:05,153 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 444 [2018-01-30 02:11:05,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:05,163 INFO L225 Difference]: With dead ends: 16329 [2018-01-30 02:11:05,163 INFO L226 Difference]: Without dead ends: 11889 [2018-01-30 02:11:05,169 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 443 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-01-30 02:11:05,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11889 states. [2018-01-30 02:11:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11889 to 8769. [2018-01-30 02:11:05,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8769 states. [2018-01-30 02:11:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8769 states to 8769 states and 10307 transitions. [2018-01-30 02:11:05,308 INFO L78 Accepts]: Start accepts. Automaton has 8769 states and 10307 transitions. Word has length 444 [2018-01-30 02:11:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:05,308 INFO L432 AbstractCegarLoop]: Abstraction has 8769 states and 10307 transitions. [2018-01-30 02:11:05,308 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 02:11:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 8769 states and 10307 transitions. [2018-01-30 02:11:05,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-01-30 02:11:05,316 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:05,317 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:05,317 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:05,317 INFO L82 PathProgramCache]: Analyzing trace with hash 16052724, now seen corresponding path program 1 times [2018-01-30 02:11:05,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:05,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:05,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:05,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:05,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:05,339 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:05,753 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 393 proven. 0 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2018-01-30 02:11:05,753 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:05,753 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:05,753 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:05,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:05,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:05,754 INFO L87 Difference]: Start difference. First operand 8769 states and 10307 transitions. Second operand 4 states. [2018-01-30 02:11:05,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:05,960 INFO L93 Difference]: Finished difference Result 18104 states and 21275 transitions. [2018-01-30 02:11:05,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:11:05,961 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 444 [2018-01-30 02:11:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:05,968 INFO L225 Difference]: With dead ends: 18104 [2018-01-30 02:11:05,968 INFO L226 Difference]: Without dead ends: 9417 [2018-01-30 02:11:05,976 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:05,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9417 states. [2018-01-30 02:11:06,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9417 to 9044. [2018-01-30 02:11:06,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9044 states. [2018-01-30 02:11:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9044 states to 9044 states and 10652 transitions. [2018-01-30 02:11:06,062 INFO L78 Accepts]: Start accepts. Automaton has 9044 states and 10652 transitions. Word has length 444 [2018-01-30 02:11:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:06,063 INFO L432 AbstractCegarLoop]: Abstraction has 9044 states and 10652 transitions. [2018-01-30 02:11:06,063 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9044 states and 10652 transitions. [2018-01-30 02:11:06,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2018-01-30 02:11:06,068 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:06,068 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:06,068 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:06,068 INFO L82 PathProgramCache]: Analyzing trace with hash 866176395, now seen corresponding path program 1 times [2018-01-30 02:11:06,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:06,069 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:06,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:06,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:06,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:06,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:06,084 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:06,396 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 410 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2018-01-30 02:11:06,397 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:06,397 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:06,397 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:06,397 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:06,397 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:06,397 INFO L87 Difference]: Start difference. First operand 9044 states and 10652 transitions. Second operand 4 states. [2018-01-30 02:11:06,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:06,632 INFO L93 Difference]: Finished difference Result 19001 states and 22360 transitions. [2018-01-30 02:11:06,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:06,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 446 [2018-01-30 02:11:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:06,639 INFO L225 Difference]: With dead ends: 19001 [2018-01-30 02:11:06,639 INFO L226 Difference]: Without dead ends: 10039 [2018-01-30 02:11:06,646 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10039 states. [2018-01-30 02:11:06,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10039 to 9074. [2018-01-30 02:11:06,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9074 states. [2018-01-30 02:11:06,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9074 states to 9074 states and 10682 transitions. [2018-01-30 02:11:06,733 INFO L78 Accepts]: Start accepts. Automaton has 9074 states and 10682 transitions. Word has length 446 [2018-01-30 02:11:06,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:06,733 INFO L432 AbstractCegarLoop]: Abstraction has 9074 states and 10682 transitions. [2018-01-30 02:11:06,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:06,733 INFO L276 IsEmpty]: Start isEmpty. Operand 9074 states and 10682 transitions. [2018-01-30 02:11:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 448 [2018-01-30 02:11:06,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:06,738 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:06,739 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1706848172, now seen corresponding path program 1 times [2018-01-30 02:11:06,739 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:06,739 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:06,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:06,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:06,740 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:06,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2018-01-30 02:11:07,032 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:07,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:07,033 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:07,033 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:07,033 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:07,033 INFO L87 Difference]: Start difference. First operand 9074 states and 10682 transitions. Second operand 4 states. [2018-01-30 02:11:07,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:07,623 INFO L93 Difference]: Finished difference Result 19240 states and 22597 transitions. [2018-01-30 02:11:07,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:07,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 447 [2018-01-30 02:11:07,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:07,629 INFO L225 Difference]: With dead ends: 19240 [2018-01-30 02:11:07,629 INFO L226 Difference]: Without dead ends: 10248 [2018-01-30 02:11:07,635 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10248 states. [2018-01-30 02:11:07,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10248 to 9089. [2018-01-30 02:11:07,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9089 states. [2018-01-30 02:11:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9089 states to 9089 states and 10697 transitions. [2018-01-30 02:11:07,728 INFO L78 Accepts]: Start accepts. Automaton has 9089 states and 10697 transitions. Word has length 447 [2018-01-30 02:11:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:07,729 INFO L432 AbstractCegarLoop]: Abstraction has 9089 states and 10697 transitions. [2018-01-30 02:11:07,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 9089 states and 10697 transitions. [2018-01-30 02:11:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-01-30 02:11:07,734 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:07,734 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:07,734 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:07,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1869216505, now seen corresponding path program 1 times [2018-01-30 02:11:07,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:07,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:07,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:07,735 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:07,735 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:07,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2018-01-30 02:11:08,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:08,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:08,048 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:08,048 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:08,048 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:08,048 INFO L87 Difference]: Start difference. First operand 9089 states and 10697 transitions. Second operand 4 states. [2018-01-30 02:11:08,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:08,323 INFO L93 Difference]: Finished difference Result 21406 states and 25141 transitions. [2018-01-30 02:11:08,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:08,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 449 [2018-01-30 02:11:08,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:08,331 INFO L225 Difference]: With dead ends: 21406 [2018-01-30 02:11:08,331 INFO L226 Difference]: Without dead ends: 12399 [2018-01-30 02:11:08,338 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:08,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-01-30 02:11:08,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 9077. [2018-01-30 02:11:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9077 states. [2018-01-30 02:11:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9077 states to 9077 states and 10685 transitions. [2018-01-30 02:11:08,433 INFO L78 Accepts]: Start accepts. Automaton has 9077 states and 10685 transitions. Word has length 449 [2018-01-30 02:11:08,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:08,433 INFO L432 AbstractCegarLoop]: Abstraction has 9077 states and 10685 transitions. [2018-01-30 02:11:08,433 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:08,433 INFO L276 IsEmpty]: Start isEmpty. Operand 9077 states and 10685 transitions. [2018-01-30 02:11:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-01-30 02:11:08,438 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:08,438 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:08,438 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:08,439 INFO L82 PathProgramCache]: Analyzing trace with hash -589401216, now seen corresponding path program 1 times [2018-01-30 02:11:08,439 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:08,439 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:08,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:08,439 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:08,439 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:08,454 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:08,807 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 420 proven. 27 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2018-01-30 02:11:08,807 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:08,807 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:11:08,812 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:08,873 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:08,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:08,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:08,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,900 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,901 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:08,904 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:11:08,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:08,928 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:08,928 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:08,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:11:08,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:08,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:08,950 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:08,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:08,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:08,954 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 644 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-01-30 02:11:09,038 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:09,038 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-01-30 02:11:09,039 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:11:09,039 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:11:09,039 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:11:09,039 INFO L87 Difference]: Start difference. First operand 9077 states and 10685 transitions. Second operand 7 states. [2018-01-30 02:11:09,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:09,507 INFO L93 Difference]: Finished difference Result 21622 states and 25293 transitions. [2018-01-30 02:11:09,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:11:09,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 459 [2018-01-30 02:11:09,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:09,515 INFO L225 Difference]: With dead ends: 21622 [2018-01-30 02:11:09,515 INFO L226 Difference]: Without dead ends: 12627 [2018-01-30 02:11:09,521 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 460 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:11:09,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12627 states. [2018-01-30 02:11:09,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12627 to 9107. [2018-01-30 02:11:09,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9107 states. [2018-01-30 02:11:09,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9107 states to 9107 states and 10715 transitions. [2018-01-30 02:11:09,619 INFO L78 Accepts]: Start accepts. Automaton has 9107 states and 10715 transitions. Word has length 459 [2018-01-30 02:11:09,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:09,619 INFO L432 AbstractCegarLoop]: Abstraction has 9107 states and 10715 transitions. [2018-01-30 02:11:09,619 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:11:09,619 INFO L276 IsEmpty]: Start isEmpty. Operand 9107 states and 10715 transitions. [2018-01-30 02:11:09,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-01-30 02:11:09,624 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:09,624 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:09,625 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:09,625 INFO L82 PathProgramCache]: Analyzing trace with hash 730109633, now seen corresponding path program 1 times [2018-01-30 02:11:09,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:09,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:09,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:09,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:09,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:09,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:09,642 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 373 proven. 36 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2018-01-30 02:11:10,360 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:10,360 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:11:10,365 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:10,426 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:10,435 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:10,436 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:10,436 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:10,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:11:10,498 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:10,499 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:10,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:10,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,503 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:11:10,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:10,516 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:10,517 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:10,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:10,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:10,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:10,525 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:10,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,527 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,527 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:10,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 02:11:10,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:11:10,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,554 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:10,554 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:3 [2018-01-30 02:11:10,627 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 373 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-01-30 02:11:10,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:10,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-01-30 02:11:10,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 02:11:10,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 02:11:10,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:10,646 INFO L87 Difference]: Start difference. First operand 9107 states and 10715 transitions. Second operand 10 states. [2018-01-30 02:11:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:12,282 INFO L93 Difference]: Finished difference Result 32256 states and 37520 transitions. [2018-01-30 02:11:12,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 02:11:12,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 463 [2018-01-30 02:11:12,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:12,297 INFO L225 Difference]: With dead ends: 32256 [2018-01-30 02:11:12,297 INFO L226 Difference]: Without dead ends: 23231 [2018-01-30 02:11:12,307 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 490 GetRequests, 465 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:11:12,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23231 states. [2018-01-30 02:11:12,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23231 to 9107. [2018-01-30 02:11:12,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9107 states. [2018-01-30 02:11:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9107 states to 9107 states and 10705 transitions. [2018-01-30 02:11:12,495 INFO L78 Accepts]: Start accepts. Automaton has 9107 states and 10705 transitions. Word has length 463 [2018-01-30 02:11:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:12,495 INFO L432 AbstractCegarLoop]: Abstraction has 9107 states and 10705 transitions. [2018-01-30 02:11:12,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 02:11:12,495 INFO L276 IsEmpty]: Start isEmpty. Operand 9107 states and 10705 transitions. [2018-01-30 02:11:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 465 [2018-01-30 02:11:12,500 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:12,501 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:12,501 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash 959823357, now seen corresponding path program 1 times [2018-01-30 02:11:12,501 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:12,501 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:12,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:12,502 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:12,502 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:12,516 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:12,788 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 377 proven. 0 refuted. 0 times theorem prover too weak. 306 trivial. 0 not checked. [2018-01-30 02:11:12,788 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:12,788 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:12,789 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:12,789 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:12,789 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:12,789 INFO L87 Difference]: Start difference. First operand 9107 states and 10705 transitions. Second operand 6 states. [2018-01-30 02:11:13,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:13,223 INFO L93 Difference]: Finished difference Result 23224 states and 27259 transitions. [2018-01-30 02:11:13,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 02:11:13,223 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 464 [2018-01-30 02:11:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:13,233 INFO L225 Difference]: With dead ends: 23224 [2018-01-30 02:11:13,233 INFO L226 Difference]: Without dead ends: 15657 [2018-01-30 02:11:13,239 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-01-30 02:11:13,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15657 states. [2018-01-30 02:11:13,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15657 to 8574. [2018-01-30 02:11:13,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8574 states. [2018-01-30 02:11:13,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 10064 transitions. [2018-01-30 02:11:13,353 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 10064 transitions. Word has length 464 [2018-01-30 02:11:13,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:13,353 INFO L432 AbstractCegarLoop]: Abstraction has 8574 states and 10064 transitions. [2018-01-30 02:11:13,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:13,353 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 10064 transitions. [2018-01-30 02:11:13,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-01-30 02:11:13,358 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:13,358 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:13,358 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:13,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1713553075, now seen corresponding path program 1 times [2018-01-30 02:11:13,358 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:13,358 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:13,359 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:13,359 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:13,378 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:13,790 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 33 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-01-30 02:11:13,791 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:13,791 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:11:13,796 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:13,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:13,859 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:13,892 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:13,893 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:13,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,895 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,895 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:13,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:11:13,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:13,903 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:13,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:13,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:11:13,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:13,926 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:13,927 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:13,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:13,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,930 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,930 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:13,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:13,936 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:13,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,937 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:13,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 02:11:13,950 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:11:13,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,951 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,951 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:13,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:3 [2018-01-30 02:11:14,025 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 391 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-01-30 02:11:14,043 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:14,043 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-01-30 02:11:14,043 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 02:11:14,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 02:11:14,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:14,044 INFO L87 Difference]: Start difference. First operand 8574 states and 10064 transitions. Second operand 10 states. [2018-01-30 02:11:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:15,603 INFO L93 Difference]: Finished difference Result 30428 states and 35372 transitions. [2018-01-30 02:11:15,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 02:11:15,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 466 [2018-01-30 02:11:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:15,617 INFO L225 Difference]: With dead ends: 30428 [2018-01-30 02:11:15,617 INFO L226 Difference]: Without dead ends: 21936 [2018-01-30 02:11:15,625 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 468 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:11:15,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21936 states. [2018-01-30 02:11:15,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21936 to 8574. [2018-01-30 02:11:15,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8574 states. [2018-01-30 02:11:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8574 states to 8574 states and 10055 transitions. [2018-01-30 02:11:15,761 INFO L78 Accepts]: Start accepts. Automaton has 8574 states and 10055 transitions. Word has length 466 [2018-01-30 02:11:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:15,761 INFO L432 AbstractCegarLoop]: Abstraction has 8574 states and 10055 transitions. [2018-01-30 02:11:15,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 02:11:15,761 INFO L276 IsEmpty]: Start isEmpty. Operand 8574 states and 10055 transitions. [2018-01-30 02:11:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-01-30 02:11:15,766 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:15,766 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:15,766 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:15,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1865640500, now seen corresponding path program 1 times [2018-01-30 02:11:15,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:15,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:15,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:15,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:15,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:15,778 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 448 proven. 0 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2018-01-30 02:11:16,377 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:16,377 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:16,377 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:16,377 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:16,377 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:16,377 INFO L87 Difference]: Start difference. First operand 8574 states and 10055 transitions. Second operand 6 states. [2018-01-30 02:11:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:17,119 INFO L93 Difference]: Finished difference Result 27185 states and 31798 transitions. [2018-01-30 02:11:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:17,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 467 [2018-01-30 02:11:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:17,131 INFO L225 Difference]: With dead ends: 27185 [2018-01-30 02:11:17,131 INFO L226 Difference]: Without dead ends: 18693 [2018-01-30 02:11:17,138 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:17,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18693 states. [2018-01-30 02:11:17,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18693 to 8779. [2018-01-30 02:11:17,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8779 states. [2018-01-30 02:11:17,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8779 states to 8779 states and 10305 transitions. [2018-01-30 02:11:17,275 INFO L78 Accepts]: Start accepts. Automaton has 8779 states and 10305 transitions. Word has length 467 [2018-01-30 02:11:17,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:17,275 INFO L432 AbstractCegarLoop]: Abstraction has 8779 states and 10305 transitions. [2018-01-30 02:11:17,275 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8779 states and 10305 transitions. [2018-01-30 02:11:17,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-01-30 02:11:17,279 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:17,280 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:17,280 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:17,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1561447936, now seen corresponding path program 1 times [2018-01-30 02:11:17,280 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:17,280 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:17,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:17,281 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:17,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:17,294 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:17,782 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 471 proven. 18 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2018-01-30 02:11:17,783 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:17,783 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:11:17,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:17,853 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:17,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:17,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:17,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,914 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,933 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,933 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:17,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:11:17,967 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:17,968 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:17,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:17,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,975 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:17,975 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:11:17,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:18,028 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:18,030 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:18,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:18,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:18,033 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:18,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:18,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 710 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2018-01-30 02:11:18,127 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:18,127 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2018-01-30 02:11:18,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:11:18,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:11:18,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:11:18,128 INFO L87 Difference]: Start difference. First operand 8779 states and 10305 transitions. Second operand 7 states. [2018-01-30 02:11:18,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:18,627 INFO L93 Difference]: Finished difference Result 21018 states and 24552 transitions. [2018-01-30 02:11:18,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-30 02:11:18,627 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 467 [2018-01-30 02:11:18,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:18,634 INFO L225 Difference]: With dead ends: 21018 [2018-01-30 02:11:18,634 INFO L226 Difference]: Without dead ends: 12321 [2018-01-30 02:11:18,640 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 478 GetRequests, 468 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:11:18,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12321 states. [2018-01-30 02:11:18,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12321 to 8860. [2018-01-30 02:11:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2018-01-30 02:11:18,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 10404 transitions. [2018-01-30 02:11:18,754 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 10404 transitions. Word has length 467 [2018-01-30 02:11:18,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:18,755 INFO L432 AbstractCegarLoop]: Abstraction has 8860 states and 10404 transitions. [2018-01-30 02:11:18,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:11:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 10404 transitions. [2018-01-30 02:11:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2018-01-30 02:11:18,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:18,759 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:18,759 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1764178909, now seen corresponding path program 1 times [2018-01-30 02:11:18,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:18,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:18,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:18,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:18,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:18,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:18,775 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:19,215 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 355 proven. 39 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2018-01-30 02:11:19,215 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-30 02:11:19,215 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-30 02:11:19,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:19,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:19,289 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-30 02:11:19,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:19,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:19,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,367 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:19,432 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-01-30 02:11:19,515 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:19,533 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:19,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-01-30 02:11:19,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,626 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,680 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:19 [2018-01-30 02:11:19,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 22 [2018-01-30 02:11:19,795 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:19,796 INFO L700 Elim1Store]: detected not equals via solver [2018-01-30 02:11:19,796 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-01-30 02:11:19,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,798 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,816 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:3 [2018-01-30 02:11:19,820 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-01-30 02:11:19,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-01-30 02:11:19,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,822 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,823 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,823 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-01-30 02:11:19,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-01-30 02:11:19,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 3 [2018-01-30 02:11:19,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,833 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-30 02:11:19,834 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:3 [2018-01-30 02:11:19,906 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 355 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-01-30 02:11:19,923 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-30 02:11:19,923 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [8] total 10 [2018-01-30 02:11:19,924 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-30 02:11:19,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-30 02:11:19,924 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:19,924 INFO L87 Difference]: Start difference. First operand 8860 states and 10404 transitions. Second operand 10 states. [2018-01-30 02:11:21,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:21,273 INFO L93 Difference]: Finished difference Result 30898 states and 35914 transitions. [2018-01-30 02:11:21,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-30 02:11:21,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 467 [2018-01-30 02:11:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:21,287 INFO L225 Difference]: With dead ends: 30898 [2018-01-30 02:11:21,287 INFO L226 Difference]: Without dead ends: 22120 [2018-01-30 02:11:21,296 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 469 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2018-01-30 02:11:21,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22120 states. [2018-01-30 02:11:21,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22120 to 8860. [2018-01-30 02:11:21,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8860 states. [2018-01-30 02:11:21,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8860 states to 8860 states and 10395 transitions. [2018-01-30 02:11:21,448 INFO L78 Accepts]: Start accepts. Automaton has 8860 states and 10395 transitions. Word has length 467 [2018-01-30 02:11:21,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:21,449 INFO L432 AbstractCegarLoop]: Abstraction has 8860 states and 10395 transitions. [2018-01-30 02:11:21,449 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-30 02:11:21,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8860 states and 10395 transitions. [2018-01-30 02:11:21,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-01-30 02:11:21,453 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:21,454 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:21,454 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:21,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1220318206, now seen corresponding path program 1 times [2018-01-30 02:11:21,454 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:21,454 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:21,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:21,455 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:21,455 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:21,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:21,468 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:21,771 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:21,772 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:21,772 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:21,772 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:21,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:21,772 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:21,772 INFO L87 Difference]: Start difference. First operand 8860 states and 10395 transitions. Second operand 6 states. [2018-01-30 02:11:22,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:22,581 INFO L93 Difference]: Finished difference Result 32256 states and 37796 transitions. [2018-01-30 02:11:22,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:22,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 469 [2018-01-30 02:11:22,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:22,596 INFO L225 Difference]: With dead ends: 32256 [2018-01-30 02:11:22,596 INFO L226 Difference]: Without dead ends: 23478 [2018-01-30 02:11:22,604 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23478 states. [2018-01-30 02:11:22,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23478 to 9124. [2018-01-30 02:11:22,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9124 states. [2018-01-30 02:11:22,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9124 states to 9124 states and 10714 transitions. [2018-01-30 02:11:22,770 INFO L78 Accepts]: Start accepts. Automaton has 9124 states and 10714 transitions. Word has length 469 [2018-01-30 02:11:22,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:22,770 INFO L432 AbstractCegarLoop]: Abstraction has 9124 states and 10714 transitions. [2018-01-30 02:11:22,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:22,770 INFO L276 IsEmpty]: Start isEmpty. Operand 9124 states and 10714 transitions. [2018-01-30 02:11:22,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-01-30 02:11:22,775 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:22,775 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:22,775 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:22,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1804502338, now seen corresponding path program 1 times [2018-01-30 02:11:22,775 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:22,775 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:22,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:22,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:22,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:22,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:23,062 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 241 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:23,063 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:23,063 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:23,063 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:23,063 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:23,063 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:23,063 INFO L87 Difference]: Start difference. First operand 9124 states and 10714 transitions. Second operand 6 states. [2018-01-30 02:11:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:23,825 INFO L93 Difference]: Finished difference Result 32619 states and 38214 transitions. [2018-01-30 02:11:23,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:23,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 469 [2018-01-30 02:11:23,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:23,841 INFO L225 Difference]: With dead ends: 32619 [2018-01-30 02:11:23,841 INFO L226 Difference]: Without dead ends: 23577 [2018-01-30 02:11:23,851 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23577 states. [2018-01-30 02:11:24,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23577 to 8926. [2018-01-30 02:11:24,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2018-01-30 02:11:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 10461 transitions. [2018-01-30 02:11:24,024 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 10461 transitions. Word has length 469 [2018-01-30 02:11:24,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:24,024 INFO L432 AbstractCegarLoop]: Abstraction has 8926 states and 10461 transitions. [2018-01-30 02:11:24,024 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 10461 transitions. [2018-01-30 02:11:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-01-30 02:11:24,029 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:24,029 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:24,029 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:24,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2147238662, now seen corresponding path program 1 times [2018-01-30 02:11:24,030 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:24,030 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:24,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:24,030 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:24,030 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:24,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:24,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:24,586 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:24,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:24,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:24,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:24,586 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:24,586 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:24,587 INFO L87 Difference]: Start difference. First operand 8926 states and 10461 transitions. Second operand 6 states. [2018-01-30 02:11:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:25,364 INFO L93 Difference]: Finished difference Result 32342 states and 37870 transitions. [2018-01-30 02:11:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:25,364 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 472 [2018-01-30 02:11:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:25,378 INFO L225 Difference]: With dead ends: 32342 [2018-01-30 02:11:25,378 INFO L226 Difference]: Without dead ends: 23498 [2018-01-30 02:11:25,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23498 states. [2018-01-30 02:11:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23498 to 9190. [2018-01-30 02:11:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9190 states. [2018-01-30 02:11:25,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9190 states to 9190 states and 10780 transitions. [2018-01-30 02:11:25,559 INFO L78 Accepts]: Start accepts. Automaton has 9190 states and 10780 transitions. Word has length 472 [2018-01-30 02:11:25,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:25,559 INFO L432 AbstractCegarLoop]: Abstraction has 9190 states and 10780 transitions. [2018-01-30 02:11:25,559 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:25,560 INFO L276 IsEmpty]: Start isEmpty. Operand 9190 states and 10780 transitions. [2018-01-30 02:11:25,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-01-30 02:11:25,564 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:25,564 INFO L350 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:25,564 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:25,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1867227590, now seen corresponding path program 1 times [2018-01-30 02:11:25,565 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:25,565 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:25,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:25,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:25,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:25,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 753 backedges. 243 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:26,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:26,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:26,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:26,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:26,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:26,041 INFO L87 Difference]: Start difference. First operand 9190 states and 10780 transitions. Second operand 6 states. [2018-01-30 02:11:27,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:27,025 INFO L93 Difference]: Finished difference Result 32606 states and 38189 transitions. [2018-01-30 02:11:27,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:27,026 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 472 [2018-01-30 02:11:27,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:27,040 INFO L225 Difference]: With dead ends: 32606 [2018-01-30 02:11:27,040 INFO L226 Difference]: Without dead ends: 23498 [2018-01-30 02:11:27,048 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-30 02:11:27,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23498 states. [2018-01-30 02:11:27,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23498 to 8926. [2018-01-30 02:11:27,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8926 states. [2018-01-30 02:11:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8926 states to 8926 states and 10461 transitions. [2018-01-30 02:11:27,225 INFO L78 Accepts]: Start accepts. Automaton has 8926 states and 10461 transitions. Word has length 472 [2018-01-30 02:11:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:27,225 INFO L432 AbstractCegarLoop]: Abstraction has 8926 states and 10461 transitions. [2018-01-30 02:11:27,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:27,226 INFO L276 IsEmpty]: Start isEmpty. Operand 8926 states and 10461 transitions. [2018-01-30 02:11:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-01-30 02:11:27,230 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:27,230 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:27,231 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -159313570, now seen corresponding path program 1 times [2018-01-30 02:11:27,231 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:27,231 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:27,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:27,231 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:27,231 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:27,245 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:27,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:27,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:27,461 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:27,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:27,461 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:27,461 INFO L87 Difference]: Start difference. First operand 8926 states and 10461 transitions. Second operand 4 states. [2018-01-30 02:11:27,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:27,853 INFO L93 Difference]: Finished difference Result 20838 states and 24376 transitions. [2018-01-30 02:11:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:27,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2018-01-30 02:11:27,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:27,861 INFO L225 Difference]: With dead ends: 20838 [2018-01-30 02:11:27,861 INFO L226 Difference]: Without dead ends: 11994 [2018-01-30 02:11:27,867 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:27,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11994 states. [2018-01-30 02:11:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11994 to 9278. [2018-01-30 02:11:28,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9278 states. [2018-01-30 02:11:28,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9278 states to 9278 states and 10879 transitions. [2018-01-30 02:11:28,017 INFO L78 Accepts]: Start accepts. Automaton has 9278 states and 10879 transitions. Word has length 497 [2018-01-30 02:11:28,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:28,018 INFO L432 AbstractCegarLoop]: Abstraction has 9278 states and 10879 transitions. [2018-01-30 02:11:28,018 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:28,018 INFO L276 IsEmpty]: Start isEmpty. Operand 9278 states and 10879 transitions. [2018-01-30 02:11:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-01-30 02:11:28,023 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:28,023 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:28,023 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:28,023 INFO L82 PathProgramCache]: Analyzing trace with hash 795629598, now seen corresponding path program 1 times [2018-01-30 02:11:28,023 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:28,023 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:28,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:28,024 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:28,024 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:28,038 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:28,292 INFO L134 CoverageAnalysis]: Checked inductivity of 867 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:28,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:28,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:28,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:28,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:28,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:28,293 INFO L87 Difference]: Start difference. First operand 9278 states and 10879 transitions. Second operand 4 states. [2018-01-30 02:11:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:28,700 INFO L93 Difference]: Finished difference Result 21311 states and 24926 transitions. [2018-01-30 02:11:28,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:28,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 497 [2018-01-30 02:11:28,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:28,707 INFO L225 Difference]: With dead ends: 21311 [2018-01-30 02:11:28,707 INFO L226 Difference]: Without dead ends: 12115 [2018-01-30 02:11:28,714 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:28,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12115 states. [2018-01-30 02:11:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12115 to 9047. [2018-01-30 02:11:28,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9047 states. [2018-01-30 02:11:28,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9047 states to 9047 states and 10593 transitions. [2018-01-30 02:11:28,862 INFO L78 Accepts]: Start accepts. Automaton has 9047 states and 10593 transitions. Word has length 497 [2018-01-30 02:11:28,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:28,863 INFO L432 AbstractCegarLoop]: Abstraction has 9047 states and 10593 transitions. [2018-01-30 02:11:28,863 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:28,863 INFO L276 IsEmpty]: Start isEmpty. Operand 9047 states and 10593 transitions. [2018-01-30 02:11:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-01-30 02:11:28,868 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:28,868 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:28,868 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:28,868 INFO L82 PathProgramCache]: Analyzing trace with hash 590099436, now seen corresponding path program 1 times [2018-01-30 02:11:28,868 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:28,868 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:28,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:28,869 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:28,869 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:28,882 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:29,078 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:29,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:29,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:29,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:29,079 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:29,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:29,079 INFO L87 Difference]: Start difference. First operand 9047 states and 10593 transitions. Second operand 4 states. [2018-01-30 02:11:29,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:29,494 INFO L93 Difference]: Finished difference Result 21074 states and 24623 transitions. [2018-01-30 02:11:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:29,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 500 [2018-01-30 02:11:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:29,502 INFO L225 Difference]: With dead ends: 21074 [2018-01-30 02:11:29,502 INFO L226 Difference]: Without dead ends: 12109 [2018-01-30 02:11:29,509 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:29,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12109 states. [2018-01-30 02:11:29,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12109 to 9432. [2018-01-30 02:11:29,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9432 states. [2018-01-30 02:11:29,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9432 states to 9432 states and 11044 transitions. [2018-01-30 02:11:29,670 INFO L78 Accepts]: Start accepts. Automaton has 9432 states and 11044 transitions. Word has length 500 [2018-01-30 02:11:29,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:29,670 INFO L432 AbstractCegarLoop]: Abstraction has 9432 states and 11044 transitions. [2018-01-30 02:11:29,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:29,671 INFO L276 IsEmpty]: Start isEmpty. Operand 9432 states and 11044 transitions. [2018-01-30 02:11:29,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-01-30 02:11:29,676 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:29,676 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:29,676 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -561351380, now seen corresponding path program 1 times [2018-01-30 02:11:29,676 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:29,676 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:29,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:29,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:29,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:29,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:29,691 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 888 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:29,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:29,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:29,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:29,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:29,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:29,950 INFO L87 Difference]: Start difference. First operand 9432 states and 11044 transitions. Second operand 4 states. [2018-01-30 02:11:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:30,416 INFO L93 Difference]: Finished difference Result 21492 states and 25107 transitions. [2018-01-30 02:11:30,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:30,416 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 500 [2018-01-30 02:11:30,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:30,423 INFO L225 Difference]: With dead ends: 21492 [2018-01-30 02:11:30,423 INFO L226 Difference]: Without dead ends: 12142 [2018-01-30 02:11:30,430 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12142 states. [2018-01-30 02:11:30,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12142 to 9080. [2018-01-30 02:11:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9080 states. [2018-01-30 02:11:30,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 10626 transitions. [2018-01-30 02:11:30,585 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 10626 transitions. Word has length 500 [2018-01-30 02:11:30,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:30,585 INFO L432 AbstractCegarLoop]: Abstraction has 9080 states and 10626 transitions. [2018-01-30 02:11:30,585 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:30,585 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 10626 transitions. [2018-01-30 02:11:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-01-30 02:11:30,590 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:30,590 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:30,590 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:30,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1783268034, now seen corresponding path program 1 times [2018-01-30 02:11:30,591 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:30,591 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:30,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:30,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:30,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:30,604 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:30,818 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:30,818 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:30,818 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:30,818 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:30,818 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:30,819 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:30,819 INFO L87 Difference]: Start difference. First operand 9080 states and 10626 transitions. Second operand 4 states. [2018-01-30 02:11:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:31,210 INFO L93 Difference]: Finished difference Result 21122 states and 24660 transitions. [2018-01-30 02:11:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:31,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 501 [2018-01-30 02:11:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:31,218 INFO L225 Difference]: With dead ends: 21122 [2018-01-30 02:11:31,218 INFO L226 Difference]: Without dead ends: 12124 [2018-01-30 02:11:31,225 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:31,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12124 states. [2018-01-30 02:11:31,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12124 to 9399. [2018-01-30 02:11:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9399 states. [2018-01-30 02:11:31,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9399 states to 9399 states and 11000 transitions. [2018-01-30 02:11:31,395 INFO L78 Accepts]: Start accepts. Automaton has 9399 states and 11000 transitions. Word has length 501 [2018-01-30 02:11:31,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:31,396 INFO L432 AbstractCegarLoop]: Abstraction has 9399 states and 11000 transitions. [2018-01-30 02:11:31,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:31,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9399 states and 11000 transitions. [2018-01-30 02:11:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-01-30 02:11:31,401 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:31,401 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:31,401 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:31,402 INFO L82 PathProgramCache]: Analyzing trace with hash 448031106, now seen corresponding path program 1 times [2018-01-30 02:11:31,402 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:31,402 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:31,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:31,402 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:31,402 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:31,416 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 846 backedges. 336 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:31,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:31,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:31,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:31,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:31,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:31,696 INFO L87 Difference]: Start difference. First operand 9399 states and 11000 transitions. Second operand 4 states. [2018-01-30 02:11:32,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:32,086 INFO L93 Difference]: Finished difference Result 21441 states and 25023 transitions. [2018-01-30 02:11:32,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:32,087 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 501 [2018-01-30 02:11:32,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:32,093 INFO L225 Difference]: With dead ends: 21441 [2018-01-30 02:11:32,094 INFO L226 Difference]: Without dead ends: 12124 [2018-01-30 02:11:32,100 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:32,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12124 states. [2018-01-30 02:11:32,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12124 to 9080. [2018-01-30 02:11:32,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9080 states. [2018-01-30 02:11:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9080 states to 9080 states and 10615 transitions. [2018-01-30 02:11:32,261 INFO L78 Accepts]: Start accepts. Automaton has 9080 states and 10615 transitions. Word has length 501 [2018-01-30 02:11:32,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:32,261 INFO L432 AbstractCegarLoop]: Abstraction has 9080 states and 10615 transitions. [2018-01-30 02:11:32,261 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:32,261 INFO L276 IsEmpty]: Start isEmpty. Operand 9080 states and 10615 transitions. [2018-01-30 02:11:32,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-01-30 02:11:32,266 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:32,266 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:32,267 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:32,267 INFO L82 PathProgramCache]: Analyzing trace with hash 2106821542, now seen corresponding path program 1 times [2018-01-30 02:11:32,267 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:32,267 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:32,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:32,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:32,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:32,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:32,280 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:32,586 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:32,586 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:32,586 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:32,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:32,587 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:32,587 INFO L87 Difference]: Start difference. First operand 9080 states and 10615 transitions. Second operand 4 states. [2018-01-30 02:11:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:33,000 INFO L93 Difference]: Finished difference Result 21116 states and 24621 transitions. [2018-01-30 02:11:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:33,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2018-01-30 02:11:33,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:33,007 INFO L225 Difference]: With dead ends: 21116 [2018-01-30 02:11:33,007 INFO L226 Difference]: Without dead ends: 12118 [2018-01-30 02:11:33,014 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12118 states. [2018-01-30 02:11:33,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12118 to 9498. [2018-01-30 02:11:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9498 states. [2018-01-30 02:11:33,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9498 states to 9498 states and 11088 transitions. [2018-01-30 02:11:33,188 INFO L78 Accepts]: Start accepts. Automaton has 9498 states and 11088 transitions. Word has length 503 [2018-01-30 02:11:33,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:33,188 INFO L432 AbstractCegarLoop]: Abstraction has 9498 states and 11088 transitions. [2018-01-30 02:11:33,188 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 9498 states and 11088 transitions. [2018-01-30 02:11:33,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2018-01-30 02:11:33,194 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:33,194 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:33,194 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1155612058, now seen corresponding path program 1 times [2018-01-30 02:11:33,194 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:33,194 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:33,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:33,195 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:33,195 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:33,208 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 909 backedges. 399 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:33,476 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:33,476 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:33,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:33,477 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:33,477 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:33,477 INFO L87 Difference]: Start difference. First operand 9498 states and 11088 transitions. Second operand 4 states. [2018-01-30 02:11:33,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:33,879 INFO L93 Difference]: Finished difference Result 21567 states and 25127 transitions. [2018-01-30 02:11:33,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:33,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 503 [2018-01-30 02:11:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:33,886 INFO L225 Difference]: With dead ends: 21567 [2018-01-30 02:11:33,886 INFO L226 Difference]: Without dead ends: 12151 [2018-01-30 02:11:33,892 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:33,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12151 states. [2018-01-30 02:11:34,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12151 to 9113. [2018-01-30 02:11:34,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9113 states. [2018-01-30 02:11:34,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9113 states to 9113 states and 10648 transitions. [2018-01-30 02:11:34,061 INFO L78 Accepts]: Start accepts. Automaton has 9113 states and 10648 transitions. Word has length 503 [2018-01-30 02:11:34,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:34,061 INFO L432 AbstractCegarLoop]: Abstraction has 9113 states and 10648 transitions. [2018-01-30 02:11:34,061 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:34,061 INFO L276 IsEmpty]: Start isEmpty. Operand 9113 states and 10648 transitions. [2018-01-30 02:11:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-01-30 02:11:34,066 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:34,067 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:34,067 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash 276435740, now seen corresponding path program 1 times [2018-01-30 02:11:34,067 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:34,067 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:34,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:34,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:34,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:34,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:34,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:34,303 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 598 trivial. 0 not checked. [2018-01-30 02:11:34,303 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:34,304 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:34,304 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:34,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:34,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:34,304 INFO L87 Difference]: Start difference. First operand 9113 states and 10648 transitions. Second operand 4 states. [2018-01-30 02:11:34,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:34,757 INFO L93 Difference]: Finished difference Result 19241 states and 22447 transitions. [2018-01-30 02:11:34,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:34,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 504 [2018-01-30 02:11:34,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:34,763 INFO L225 Difference]: With dead ends: 19241 [2018-01-30 02:11:34,763 INFO L226 Difference]: Without dead ends: 10210 [2018-01-30 02:11:34,767 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:34,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10210 states. [2018-01-30 02:11:34,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10210 to 9113. [2018-01-30 02:11:34,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9113 states. [2018-01-30 02:11:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9113 states to 9113 states and 10648 transitions. [2018-01-30 02:11:34,929 INFO L78 Accepts]: Start accepts. Automaton has 9113 states and 10648 transitions. Word has length 504 [2018-01-30 02:11:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:34,930 INFO L432 AbstractCegarLoop]: Abstraction has 9113 states and 10648 transitions. [2018-01-30 02:11:34,930 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9113 states and 10648 transitions. [2018-01-30 02:11:34,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-01-30 02:11:34,935 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:34,935 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:34,935 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:34,935 INFO L82 PathProgramCache]: Analyzing trace with hash 418025140, now seen corresponding path program 1 times [2018-01-30 02:11:34,935 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:34,935 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:34,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:34,936 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:34,936 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:34,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:35,189 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:35,190 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:35,190 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:35,190 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:35,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:35,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:35,190 INFO L87 Difference]: Start difference. First operand 9113 states and 10648 transitions. Second operand 4 states. [2018-01-30 02:11:35,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:35,606 INFO L93 Difference]: Finished difference Result 21032 states and 24514 transitions. [2018-01-30 02:11:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:35,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 506 [2018-01-30 02:11:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:35,614 INFO L225 Difference]: With dead ends: 21032 [2018-01-30 02:11:35,614 INFO L226 Difference]: Without dead ends: 12001 [2018-01-30 02:11:35,619 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:35,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12001 states. [2018-01-30 02:11:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12001 to 9564. [2018-01-30 02:11:35,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9564 states. [2018-01-30 02:11:35,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 11154 transitions. [2018-01-30 02:11:35,797 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 11154 transitions. Word has length 506 [2018-01-30 02:11:35,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:35,797 INFO L432 AbstractCegarLoop]: Abstraction has 9564 states and 11154 transitions. [2018-01-30 02:11:35,798 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:35,798 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 11154 transitions. [2018-01-30 02:11:35,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-01-30 02:11:35,803 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:35,803 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:35,803 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash 73588724, now seen corresponding path program 1 times [2018-01-30 02:11:35,803 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:35,803 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:35,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:35,804 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:35,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:35,816 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 420 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:36,120 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:36,120 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:11:36,120 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:11:36,120 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:11:36,120 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:11:36,120 INFO L87 Difference]: Start difference. First operand 9564 states and 11154 transitions. Second operand 4 states. [2018-01-30 02:11:36,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:36,558 INFO L93 Difference]: Finished difference Result 21516 states and 25053 transitions. [2018-01-30 02:11:36,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:11:36,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 506 [2018-01-30 02:11:36,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:36,565 INFO L225 Difference]: With dead ends: 21516 [2018-01-30 02:11:36,565 INFO L226 Difference]: Without dead ends: 12034 [2018-01-30 02:11:36,572 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:11:36,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12034 states. [2018-01-30 02:11:36,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12034 to 9146. [2018-01-30 02:11:36,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9146 states. [2018-01-30 02:11:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9146 states to 9146 states and 10681 transitions. [2018-01-30 02:11:36,746 INFO L78 Accepts]: Start accepts. Automaton has 9146 states and 10681 transitions. Word has length 506 [2018-01-30 02:11:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:36,746 INFO L432 AbstractCegarLoop]: Abstraction has 9146 states and 10681 transitions. [2018-01-30 02:11:36,746 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:11:36,746 INFO L276 IsEmpty]: Start isEmpty. Operand 9146 states and 10681 transitions. [2018-01-30 02:11:36,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-01-30 02:11:36,751 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:36,751 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:36,751 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:36,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1023601235, now seen corresponding path program 1 times [2018-01-30 02:11:36,752 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:36,752 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:36,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:36,752 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:36,752 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:36,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:37,029 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:37,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:37,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:37,029 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:37,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:37,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:37,030 INFO L87 Difference]: Start difference. First operand 9146 states and 10681 transitions. Second operand 6 states. [2018-01-30 02:11:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:37,955 INFO L93 Difference]: Finished difference Result 32260 states and 37512 transitions. [2018-01-30 02:11:37,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:37,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 510 [2018-01-30 02:11:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:37,970 INFO L225 Difference]: With dead ends: 32260 [2018-01-30 02:11:37,970 INFO L226 Difference]: Without dead ends: 23196 [2018-01-30 02:11:37,979 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:37,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23196 states. [2018-01-30 02:11:38,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23196 to 9531. [2018-01-30 02:11:38,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9531 states. [2018-01-30 02:11:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9531 states to 9531 states and 11132 transitions. [2018-01-30 02:11:38,280 INFO L78 Accepts]: Start accepts. Automaton has 9531 states and 11132 transitions. Word has length 510 [2018-01-30 02:11:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:38,281 INFO L432 AbstractCegarLoop]: Abstraction has 9531 states and 11132 transitions. [2018-01-30 02:11:38,281 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 9531 states and 11132 transitions. [2018-01-30 02:11:38,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-01-30 02:11:38,286 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:38,286 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:38,286 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:38,286 INFO L82 PathProgramCache]: Analyzing trace with hash 628136851, now seen corresponding path program 1 times [2018-01-30 02:11:38,287 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:38,287 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:38,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:38,287 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:38,287 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:38,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:38,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:38,589 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:38,589 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:38,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:38,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:38,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:38,590 INFO L87 Difference]: Start difference. First operand 9531 states and 11132 transitions. Second operand 6 states. [2018-01-30 02:11:39,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:39,533 INFO L93 Difference]: Finished difference Result 32645 states and 37952 transitions. [2018-01-30 02:11:39,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:39,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 510 [2018-01-30 02:11:39,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:39,547 INFO L225 Difference]: With dead ends: 32645 [2018-01-30 02:11:39,547 INFO L226 Difference]: Without dead ends: 23196 [2018-01-30 02:11:39,556 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23196 states. [2018-01-30 02:11:39,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23196 to 9146. [2018-01-30 02:11:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9146 states. [2018-01-30 02:11:39,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9146 states to 9146 states and 10670 transitions. [2018-01-30 02:11:39,778 INFO L78 Accepts]: Start accepts. Automaton has 9146 states and 10670 transitions. Word has length 510 [2018-01-30 02:11:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:39,778 INFO L432 AbstractCegarLoop]: Abstraction has 9146 states and 10670 transitions. [2018-01-30 02:11:39,778 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 9146 states and 10670 transitions. [2018-01-30 02:11:39,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-01-30 02:11:39,784 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:39,784 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:39,784 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:39,784 INFO L82 PathProgramCache]: Analyzing trace with hash 598391511, now seen corresponding path program 1 times [2018-01-30 02:11:39,784 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:39,784 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:39,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:39,785 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:39,785 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:39,798 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:40,168 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:40,168 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:40,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:40,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:40,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:40,169 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:40,169 INFO L87 Difference]: Start difference. First operand 9146 states and 10670 transitions. Second operand 6 states. [2018-01-30 02:11:41,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:11:41,107 INFO L93 Difference]: Finished difference Result 32254 states and 37473 transitions. [2018-01-30 02:11:41,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:41,108 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 513 [2018-01-30 02:11:41,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:11:41,121 INFO L225 Difference]: With dead ends: 32254 [2018-01-30 02:11:41,121 INFO L226 Difference]: Without dead ends: 23190 [2018-01-30 02:11:41,130 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:11:41,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23190 states. [2018-01-30 02:11:41,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23190 to 9564. [2018-01-30 02:11:41,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9564 states. [2018-01-30 02:11:41,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9564 states to 9564 states and 11154 transitions. [2018-01-30 02:11:41,362 INFO L78 Accepts]: Start accepts. Automaton has 9564 states and 11154 transitions. Word has length 513 [2018-01-30 02:11:41,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:11:41,362 INFO L432 AbstractCegarLoop]: Abstraction has 9564 states and 11154 transitions. [2018-01-30 02:11:41,362 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:11:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 9564 states and 11154 transitions. [2018-01-30 02:11:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2018-01-30 02:11:41,367 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:11:41,367 INFO L350 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:11:41,368 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ssl3_connectErr0AssertViolation]=== [2018-01-30 02:11:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 414220695, now seen corresponding path program 1 times [2018-01-30 02:11:41,368 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:11:41,368 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:11:41,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:41,368 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:11:41,368 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:11:41,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:11:41,381 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:11:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 876 backedges. 366 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2018-01-30 02:11:41,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:11:41,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:11:41,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:11:41,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:11:41,778 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:11:41,778 INFO L87 Difference]: Start difference. First operand 9564 states and 11154 transitions. Second operand 6 states. Received shutdown request... [2018-01-30 02:11:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:11:42,317 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:11:42,320 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:11:42,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:11:42 BoogieIcfgContainer [2018-01-30 02:11:42,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:11:42,321 INFO L168 Benchmark]: Toolchain (without parser) took 62128.31 ms. Allocated memory was 147.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 110.9 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 686.8 MB. Max. memory is 5.3 GB. [2018-01-30 02:11:42,322 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 147.8 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:11:42,322 INFO L168 Benchmark]: CACSL2BoogieTranslator took 301.25 ms. Allocated memory is still 147.8 MB. Free memory was 110.9 MB in the beginning and 84.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. [2018-01-30 02:11:42,322 INFO L168 Benchmark]: Boogie Preprocessor took 39.31 ms. Allocated memory is still 147.8 MB. Free memory was 84.1 MB in the beginning and 80.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. [2018-01-30 02:11:42,322 INFO L168 Benchmark]: RCFGBuilder took 1460.21 ms. Allocated memory was 147.8 MB in the beginning and 168.8 MB in the end (delta: 21.0 MB). Free memory was 80.6 MB in the beginning and 114.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-01-30 02:11:42,322 INFO L168 Benchmark]: TraceAbstraction took 60324.59 ms. Allocated memory was 168.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 114.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 669.4 MB. Max. memory is 5.3 GB. [2018-01-30 02:11:42,323 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09 ms. Allocated memory is still 147.8 MB. Free memory is still 117.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 301.25 ms. Allocated memory is still 147.8 MB. Free memory was 110.9 MB in the beginning and 84.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.31 ms. Allocated memory is still 147.8 MB. Free memory was 84.1 MB in the beginning and 80.6 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1460.21 ms. Allocated memory was 147.8 MB in the beginning and 168.8 MB in the end (delta: 21.0 MB). Free memory was 80.6 MB in the beginning and 114.4 MB in the end (delta: -33.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * TraceAbstraction took 60324.59 ms. Allocated memory was 168.8 MB in the beginning and 2.0 GB in the end (delta: 1.8 GB). Free memory was 114.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 669.4 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1646]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1646). Cancelled while BasicCegarLoop was constructing difference of abstraction (9564states) and interpolant automaton (currently 9 states, 6 states before enhancement), while ReachableStatesComputation was computing reachable states (4537 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 568 locations, 1 error locations. TIMEOUT Result, 60.2s OverallTime, 56 OverallIterations, 8 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 50282 SDtfs, 27640 SDslu, 123974 SDs, 0 SdLazy, 30686 SolverSat, 1128 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3774 GetRequests, 3344 SyntacticMatches, 122 SemanticMatches, 308 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 7.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9564occurred in iteration=51, 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: 5.5s AutomataMinimizationTime, 55 MinimizatonAttempts, 222484 StatesRemovedByMinimization, 50 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.7s InterpolantComputationTime, 25843 NumberOfCodeBlocks, 25843 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 25780 ConstructedInterpolants, 0 QuantifiedInterpolants, 23600567 SizeOfPredicates, 25 NumberOfNonLiveVariables, 5546 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 63 InterpolantComputations, 56 PerfectInterpolantSequences, 35435/35625 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.01_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_02-11-42-327.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_clnt.blast.01_true-unreach-call.i.cil.c_svcomp-Reach-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_02-11-42-327.csv Completed graceful shutdown