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_srvr.blast.01_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a-m [2018-01-30 02:15:01,164 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 02:15:01,165 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 02:15:01,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 02:15:01,174 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 02:15:01,175 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 02:15:01,175 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 02:15:01,176 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 02:15:01,177 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 02:15:01,178 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 02:15:01,178 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 02:15:01,178 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 02:15:01,179 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 02:15:01,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 02:15:01,180 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 02:15:01,181 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 02:15:01,182 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 02:15:01,183 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 02:15:01,184 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 02:15:01,184 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 02:15:01,185 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 02:15:01,185 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 02:15:01,186 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 02:15:01,186 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 02:15:01,186 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 02:15:01,187 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 02:15:01,187 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 02:15:01,188 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 02:15:01,188 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 02:15:01,188 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 02:15:01,188 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 02:15:01,188 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:15:01,193 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 02:15:01,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 02:15:01,194 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 02:15:01,194 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 02:15:01,194 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 02:15:01,194 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 02:15:01,194 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 02:15:01,195 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-30 02:15:01,195 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-30 02:15:01,196 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 02:15:01,196 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 02:15:01,197 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 02:15:01,197 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 02:15:01,198 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 02:15:01,198 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 02:15:01,216 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 02:15:01,222 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 02:15:01,224 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 02:15:01,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 02:15:01,225 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 02:15:01,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ssh/s3_srvr.blast.01_true-unreach-call.i.cil.c [2018-01-30 02:15:01,349 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 02:15:01,350 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 02:15:01,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 02:15:01,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 02:15:01,354 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 02:15:01,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,356 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692061ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01, skipping insertion in model container [2018-01-30 02:15:01,356 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,365 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:15:01,400 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 02:15:01,533 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:15:01,572 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 02:15:01,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01 WrapperNode [2018-01-30 02:15:01,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 02:15:01,580 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 02:15:01,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 02:15:01,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 02:15:01,587 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (1/1) ... [2018-01-30 02:15:01,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 02:15:01,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 02:15:01,621 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 02:15:01,621 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 02:15:01,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (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:15:01,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 02:15:01,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 02:15:01,664 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 02:15:01,664 INFO L136 BoogieDeclarations]: Found implementation of procedure ssl3_accept [2018-01-30 02:15:01,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-30 02:15:01,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-30 02:15:01,664 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-30 02:15:01,664 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2018-01-30 02:15:01,665 INFO L128 BoogieDeclarations]: Found specification of procedure ssl3_accept [2018-01-30 02:15:01,666 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 02:15:01,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 02:15:01,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 02:15:01,907 WARN L490 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-01-30 02:15:01,908 WARN L455 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-01-30 02:15:03,023 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 02:15:03,023 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:15:03 BoogieIcfgContainer [2018-01-30 02:15:03,024 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 02:15:03,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 02:15:03,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 02:15:03,026 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 02:15:03,026 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 02:15:01" (1/3) ... [2018-01-30 02:15:03,026 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413b9b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:15:03, skipping insertion in model container [2018-01-30 02:15:03,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 02:15:01" (2/3) ... [2018-01-30 02:15:03,027 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@413b9b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 02:15:03, skipping insertion in model container [2018-01-30 02:15:03,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 02:15:03" (3/3) ... [2018-01-30 02:15:03,028 INFO L107 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01_true-unreach-call.i.cil.c [2018-01-30 02:15:03,033 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 02:15:03,037 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-01-30 02:15:03,067 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 02:15:03,067 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 02:15:03,067 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 02:15:03,067 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 02:15:03,067 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 02:15:03,067 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 02:15:03,067 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 02:15:03,068 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 02:15:03,068 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 02:15:03,081 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states. [2018-01-30 02:15:03,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-01-30 02:15:03,092 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:03,092 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:03,092 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:03,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1344481754, now seen corresponding path program 1 times [2018-01-30 02:15:03,096 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:03,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:03,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:03,128 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:03,128 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:03,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:03,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:03,643 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:15:03,645 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:03,645 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:03,647 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:03,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:03,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:03,658 INFO L87 Difference]: Start difference. First operand 604 states. Second operand 4 states. [2018-01-30 02:15:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:04,245 INFO L93 Difference]: Finished difference Result 1233 states and 1447 transitions. [2018-01-30 02:15:04,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:15:04,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-01-30 02:15:04,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:04,255 INFO L225 Difference]: With dead ends: 1233 [2018-01-30 02:15:04,255 INFO L226 Difference]: Without dead ends: 651 [2018-01-30 02:15:04,259 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-01-30 02:15:04,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 592. [2018-01-30 02:15:04,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-01-30 02:15:04,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 668 transitions. [2018-01-30 02:15:04,297 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 668 transitions. Word has length 180 [2018-01-30 02:15:04,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:04,297 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 668 transitions. [2018-01-30 02:15:04,297 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:04,298 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 668 transitions. [2018-01-30 02:15:04,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-01-30 02:15:04,300 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:04,302 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, 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] [2018-01-30 02:15:04,302 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:04,302 INFO L82 PathProgramCache]: Analyzing trace with hash -754919127, now seen corresponding path program 1 times [2018-01-30 02:15:04,302 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:04,302 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:04,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:04,303 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:04,303 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:04,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:04,549 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:04,549 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:04,550 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:04,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:04,551 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:04,551 INFO L87 Difference]: Start difference. First operand 592 states and 668 transitions. Second operand 4 states. [2018-01-30 02:15:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:04,912 INFO L93 Difference]: Finished difference Result 1135 states and 1280 transitions. [2018-01-30 02:15:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:04,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2018-01-30 02:15:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:04,915 INFO L225 Difference]: With dead ends: 1135 [2018-01-30 02:15:04,915 INFO L226 Difference]: Without dead ends: 649 [2018-01-30 02:15:04,917 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:04,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-01-30 02:15:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 592. [2018-01-30 02:15:04,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-01-30 02:15:04,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 667 transitions. [2018-01-30 02:15:04,927 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 667 transitions. Word has length 216 [2018-01-30 02:15:04,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:04,927 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 667 transitions. [2018-01-30 02:15:04,927 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:04,928 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 667 transitions. [2018-01-30 02:15:04,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-01-30 02:15:04,929 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:04,929 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:04,930 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:04,930 INFO L82 PathProgramCache]: Analyzing trace with hash 363561800, now seen corresponding path program 1 times [2018-01-30 02:15:04,930 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:04,930 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:04,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:04,931 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:04,931 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:04,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:04,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:05,259 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:05,259 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:05,260 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:05,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:05,260 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:05,260 INFO L87 Difference]: Start difference. First operand 592 states and 667 transitions. Second operand 4 states. [2018-01-30 02:15:05,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:05,659 INFO L93 Difference]: Finished difference Result 1133 states and 1277 transitions. [2018-01-30 02:15:05,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:05,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2018-01-30 02:15:05,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:05,661 INFO L225 Difference]: With dead ends: 1133 [2018-01-30 02:15:05,662 INFO L226 Difference]: Without dead ends: 647 [2018-01-30 02:15:05,662 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:05,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2018-01-30 02:15:05,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 592. [2018-01-30 02:15:05,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-01-30 02:15:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 666 transitions. [2018-01-30 02:15:05,671 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 666 transitions. Word has length 218 [2018-01-30 02:15:05,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:05,672 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 666 transitions. [2018-01-30 02:15:05,672 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:05,672 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 666 transitions. [2018-01-30 02:15:05,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-01-30 02:15:05,674 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:05,674 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:05,674 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:05,674 INFO L82 PathProgramCache]: Analyzing trace with hash -683242987, now seen corresponding path program 1 times [2018-01-30 02:15:05,674 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:05,674 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:05,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:05,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:05,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:05,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:05,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:05,856 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:15:05,856 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:05,856 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:05,856 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:05,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:05,857 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:05,857 INFO L87 Difference]: Start difference. First operand 592 states and 666 transitions. Second operand 4 states. [2018-01-30 02:15:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:06,749 INFO L93 Difference]: Finished difference Result 1132 states and 1275 transitions. [2018-01-30 02:15:06,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:06,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2018-01-30 02:15:06,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:06,751 INFO L225 Difference]: With dead ends: 1132 [2018-01-30 02:15:06,751 INFO L226 Difference]: Without dead ends: 646 [2018-01-30 02:15:06,752 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2018-01-30 02:15:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 592. [2018-01-30 02:15:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2018-01-30 02:15:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 665 transitions. [2018-01-30 02:15:06,758 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 665 transitions. Word has length 219 [2018-01-30 02:15:06,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:06,758 INFO L432 AbstractCegarLoop]: Abstraction has 592 states and 665 transitions. [2018-01-30 02:15:06,758 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:06,758 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 665 transitions. [2018-01-30 02:15:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-01-30 02:15:06,760 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:06,760 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:06,760 INFO L371 AbstractCegarLoop]: === Iteration 5 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:06,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1233264007, now seen corresponding path program 1 times [2018-01-30 02:15:06,761 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:06,761 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:06,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:06,762 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:06,762 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:06,773 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:06,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:06,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:06,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-30 02:15:06,989 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-30 02:15:06,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-30 02:15:06,989 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-30 02:15:06,989 INFO L87 Difference]: Start difference. First operand 592 states and 665 transitions. Second operand 5 states. [2018-01-30 02:15:08,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:08,000 INFO L93 Difference]: Finished difference Result 1139 states and 1286 transitions. [2018-01-30 02:15:08,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 02:15:08,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 220 [2018-01-30 02:15:08,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:08,002 INFO L225 Difference]: With dead ends: 1139 [2018-01-30 02:15:08,002 INFO L226 Difference]: Without dead ends: 653 [2018-01-30 02:15:08,002 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:15:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-01-30 02:15:08,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 642. [2018-01-30 02:15:08,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-01-30 02:15:08,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 722 transitions. [2018-01-30 02:15:08,012 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 722 transitions. Word has length 220 [2018-01-30 02:15:08,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:08,012 INFO L432 AbstractCegarLoop]: Abstraction has 642 states and 722 transitions. [2018-01-30 02:15:08,012 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-30 02:15:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 722 transitions. [2018-01-30 02:15:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-01-30 02:15:08,014 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:08,014 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, 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] [2018-01-30 02:15:08,014 INFO L371 AbstractCegarLoop]: === Iteration 6 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:08,014 INFO L82 PathProgramCache]: Analyzing trace with hash -559307184, now seen corresponding path program 1 times [2018-01-30 02:15:08,014 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:08,014 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:08,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:08,015 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:08,025 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:08,144 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:08,144 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:08,145 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:08,145 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:08,145 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:08,145 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:08,145 INFO L87 Difference]: Start difference. First operand 642 states and 722 transitions. Second operand 4 states. [2018-01-30 02:15:08,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:08,383 INFO L93 Difference]: Finished difference Result 1220 states and 1375 transitions. [2018-01-30 02:15:08,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:08,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 222 [2018-01-30 02:15:08,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:08,385 INFO L225 Difference]: With dead ends: 1220 [2018-01-30 02:15:08,385 INFO L226 Difference]: Without dead ends: 684 [2018-01-30 02:15:08,386 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:08,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-01-30 02:15:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 642. [2018-01-30 02:15:08,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-01-30 02:15:08,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 721 transitions. [2018-01-30 02:15:08,392 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 721 transitions. Word has length 222 [2018-01-30 02:15:08,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:08,393 INFO L432 AbstractCegarLoop]: Abstraction has 642 states and 721 transitions. [2018-01-30 02:15:08,393 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 721 transitions. [2018-01-30 02:15:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-01-30 02:15:08,394 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:08,394 INFO L350 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:08,394 INFO L371 AbstractCegarLoop]: === Iteration 7 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:08,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1991635680, now seen corresponding path program 1 times [2018-01-30 02:15:08,394 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:08,394 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:08,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:08,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:08,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:08,697 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:08,697 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:08,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:08,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:08,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:08,697 INFO L87 Difference]: Start difference. First operand 642 states and 721 transitions. Second operand 4 states. [2018-01-30 02:15:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:08,881 INFO L93 Difference]: Finished difference Result 1219 states and 1373 transitions. [2018-01-30 02:15:08,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:08,881 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2018-01-30 02:15:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:08,883 INFO L225 Difference]: With dead ends: 1219 [2018-01-30 02:15:08,883 INFO L226 Difference]: Without dead ends: 683 [2018-01-30 02:15:08,883 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:08,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2018-01-30 02:15:08,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 642. [2018-01-30 02:15:08,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2018-01-30 02:15:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 720 transitions. [2018-01-30 02:15:08,894 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 720 transitions. Word has length 224 [2018-01-30 02:15:08,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:08,894 INFO L432 AbstractCegarLoop]: Abstraction has 642 states and 720 transitions. [2018-01-30 02:15:08,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:08,894 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 720 transitions. [2018-01-30 02:15:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-01-30 02:15:08,895 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:08,895 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, 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] [2018-01-30 02:15:08,895 INFO L371 AbstractCegarLoop]: === Iteration 8 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:08,895 INFO L82 PathProgramCache]: Analyzing trace with hash 233735769, now seen corresponding path program 1 times [2018-01-30 02:15:08,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:08,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:08,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,896 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:08,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:08,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:08,990 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:08,990 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:08,990 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:15:08,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:15:08,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:15:08,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:15:08,991 INFO L87 Difference]: Start difference. First operand 642 states and 720 transitions. Second operand 3 states. [2018-01-30 02:15:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:09,268 INFO L93 Difference]: Finished difference Result 1703 states and 1926 transitions. [2018-01-30 02:15:09,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:15:09,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2018-01-30 02:15:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:09,270 INFO L225 Difference]: With dead ends: 1703 [2018-01-30 02:15:09,270 INFO L226 Difference]: Without dead ends: 1167 [2018-01-30 02:15:09,271 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:15:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2018-01-30 02:15:09,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 1167. [2018-01-30 02:15:09,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2018-01-30 02:15:09,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1312 transitions. [2018-01-30 02:15:09,283 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1312 transitions. Word has length 227 [2018-01-30 02:15:09,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:09,283 INFO L432 AbstractCegarLoop]: Abstraction has 1167 states and 1312 transitions. [2018-01-30 02:15:09,283 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:15:09,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1312 transitions. [2018-01-30 02:15:09,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-01-30 02:15:09,284 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:09,285 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, 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] [2018-01-30 02:15:09,285 INFO L371 AbstractCegarLoop]: === Iteration 9 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:09,285 INFO L82 PathProgramCache]: Analyzing trace with hash 872155096, now seen corresponding path program 1 times [2018-01-30 02:15:09,285 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:09,285 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:09,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:09,286 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:09,286 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:09,295 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 02:15:09,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:09,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:15:09,391 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:15:09,391 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:15:09,391 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:15:09,391 INFO L87 Difference]: Start difference. First operand 1167 states and 1312 transitions. Second operand 3 states. [2018-01-30 02:15:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:09,683 INFO L93 Difference]: Finished difference Result 2224 states and 2513 transitions. [2018-01-30 02:15:09,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:15:09,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2018-01-30 02:15:09,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:09,687 INFO L225 Difference]: With dead ends: 2224 [2018-01-30 02:15:09,687 INFO L226 Difference]: Without dead ends: 1688 [2018-01-30 02:15:09,688 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:15:09,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-01-30 02:15:09,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1688. [2018-01-30 02:15:09,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1688 states. [2018-01-30 02:15:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1688 states to 1688 states and 1899 transitions. [2018-01-30 02:15:09,703 INFO L78 Accepts]: Start accepts. Automaton has 1688 states and 1899 transitions. Word has length 228 [2018-01-30 02:15:09,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:09,703 INFO L432 AbstractCegarLoop]: Abstraction has 1688 states and 1899 transitions. [2018-01-30 02:15:09,704 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:15:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1688 states and 1899 transitions. [2018-01-30 02:15:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-30 02:15:09,705 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:09,706 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:15:09,706 INFO L371 AbstractCegarLoop]: === Iteration 10 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1153628299, now seen corresponding path program 1 times [2018-01-30 02:15:09,706 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:09,706 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:09,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:09,707 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:09,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:09,718 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:10,105 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:10,105 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:10,105 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:10,106 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:10,106 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:10,106 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:10,106 INFO L87 Difference]: Start difference. First operand 1688 states and 1899 transitions. Second operand 4 states. [2018-01-30 02:15:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:11,448 INFO L93 Difference]: Finished difference Result 4267 states and 4829 transitions. [2018-01-30 02:15:11,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:15:11,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-01-30 02:15:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:11,453 INFO L225 Difference]: With dead ends: 4267 [2018-01-30 02:15:11,453 INFO L226 Difference]: Without dead ends: 2685 [2018-01-30 02:15:11,454 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:15:11,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2685 states. [2018-01-30 02:15:11,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2685 to 2047. [2018-01-30 02:15:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2018-01-30 02:15:11,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2360 transitions. [2018-01-30 02:15:11,477 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2360 transitions. Word has length 286 [2018-01-30 02:15:11,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:11,477 INFO L432 AbstractCegarLoop]: Abstraction has 2047 states and 2360 transitions. [2018-01-30 02:15:11,477 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:11,478 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2360 transitions. [2018-01-30 02:15:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-01-30 02:15:11,480 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:11,480 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:15:11,480 INFO L371 AbstractCegarLoop]: === Iteration 11 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:11,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1308996487, now seen corresponding path program 1 times [2018-01-30 02:15:11,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:11,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:11,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:11,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:11,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:11,491 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:11,848 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:11,848 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:11,848 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:11,848 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:11,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:11,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:11,849 INFO L87 Difference]: Start difference. First operand 2047 states and 2360 transitions. Second operand 4 states. [2018-01-30 02:15:12,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:12,457 INFO L93 Difference]: Finished difference Result 4302 states and 4968 transitions. [2018-01-30 02:15:12,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:15:12,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2018-01-30 02:15:12,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:12,461 INFO L225 Difference]: With dead ends: 4302 [2018-01-30 02:15:12,461 INFO L226 Difference]: Without dead ends: 2361 [2018-01-30 02:15:12,463 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:15:12,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-01-30 02:15:12,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2181. [2018-01-30 02:15:12,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2181 states. [2018-01-30 02:15:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2181 states to 2181 states and 2528 transitions. [2018-01-30 02:15:12,508 INFO L78 Accepts]: Start accepts. Automaton has 2181 states and 2528 transitions. Word has length 286 [2018-01-30 02:15:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:12,508 INFO L432 AbstractCegarLoop]: Abstraction has 2181 states and 2528 transitions. [2018-01-30 02:15:12,509 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2181 states and 2528 transitions. [2018-01-30 02:15:12,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-30 02:15:12,511 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:12,511 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:12,512 INFO L371 AbstractCegarLoop]: === Iteration 12 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:12,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1373018500, now seen corresponding path program 1 times [2018-01-30 02:15:12,512 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:12,512 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:12,512 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:12,512 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:12,513 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:12,524 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:12,972 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:12,972 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:12,972 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:12,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:12,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:12,972 INFO L87 Difference]: Start difference. First operand 2181 states and 2528 transitions. Second operand 6 states. [2018-01-30 02:15:13,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:13,686 INFO L93 Difference]: Finished difference Result 7973 states and 9186 transitions. [2018-01-30 02:15:13,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:13,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 299 [2018-01-30 02:15:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:13,696 INFO L225 Difference]: With dead ends: 7973 [2018-01-30 02:15:13,696 INFO L226 Difference]: Without dead ends: 5898 [2018-01-30 02:15:13,699 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:13,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5898 states. [2018-01-30 02:15:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5898 to 2223. [2018-01-30 02:15:13,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2018-01-30 02:15:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2573 transitions. [2018-01-30 02:15:13,735 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2573 transitions. Word has length 299 [2018-01-30 02:15:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:13,735 INFO L432 AbstractCegarLoop]: Abstraction has 2223 states and 2573 transitions. [2018-01-30 02:15:13,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:13,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2573 transitions. [2018-01-30 02:15:13,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-01-30 02:15:13,738 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:13,738 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:13,738 INFO L371 AbstractCegarLoop]: === Iteration 13 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:13,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1158191872, now seen corresponding path program 1 times [2018-01-30 02:15:13,738 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:13,738 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:13,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:13,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:13,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:13,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:14,152 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:14,152 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:14,152 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:14,153 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:14,153 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:14,153 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:14,153 INFO L87 Difference]: Start difference. First operand 2223 states and 2573 transitions. Second operand 6 states. [2018-01-30 02:15:14,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:14,924 INFO L93 Difference]: Finished difference Result 6923 states and 8012 transitions. [2018-01-30 02:15:14,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:14,925 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 299 [2018-01-30 02:15:14,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:14,932 INFO L225 Difference]: With dead ends: 6923 [2018-01-30 02:15:14,932 INFO L226 Difference]: Without dead ends: 4806 [2018-01-30 02:15:14,935 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:14,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4806 states. [2018-01-30 02:15:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4806 to 2251. [2018-01-30 02:15:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2251 states. [2018-01-30 02:15:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2251 states to 2251 states and 2603 transitions. [2018-01-30 02:15:14,966 INFO L78 Accepts]: Start accepts. Automaton has 2251 states and 2603 transitions. Word has length 299 [2018-01-30 02:15:14,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:14,967 INFO L432 AbstractCegarLoop]: Abstraction has 2251 states and 2603 transitions. [2018-01-30 02:15:14,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:14,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2603 transitions. [2018-01-30 02:15:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:15:14,969 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:14,969 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:14,970 INFO L371 AbstractCegarLoop]: === Iteration 14 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:14,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2016701710, now seen corresponding path program 1 times [2018-01-30 02:15:14,970 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:14,970 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:14,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:14,970 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:14,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:14,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:14,981 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:15,351 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:15,351 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:15,351 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:15,352 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:15,352 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:15,352 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:15,352 INFO L87 Difference]: Start difference. First operand 2251 states and 2603 transitions. Second operand 4 states. [2018-01-30 02:15:16,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:16,722 INFO L93 Difference]: Finished difference Result 5283 states and 6109 transitions. [2018-01-30 02:15:16,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:16,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-01-30 02:15:16,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:16,727 INFO L225 Difference]: With dead ends: 5283 [2018-01-30 02:15:16,727 INFO L226 Difference]: Without dead ends: 3138 [2018-01-30 02:15:16,729 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:15:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2018-01-30 02:15:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2314. [2018-01-30 02:15:16,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2314 states. [2018-01-30 02:15:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2314 states to 2314 states and 2684 transitions. [2018-01-30 02:15:16,754 INFO L78 Accepts]: Start accepts. Automaton has 2314 states and 2684 transitions. Word has length 322 [2018-01-30 02:15:16,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:16,754 INFO L432 AbstractCegarLoop]: Abstraction has 2314 states and 2684 transitions. [2018-01-30 02:15:16,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:16,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2314 states and 2684 transitions. [2018-01-30 02:15:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-01-30 02:15:16,757 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:16,757 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:16,757 INFO L371 AbstractCegarLoop]: === Iteration 15 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:16,757 INFO L82 PathProgramCache]: Analyzing trace with hash -782870006, now seen corresponding path program 1 times [2018-01-30 02:15:16,757 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:16,757 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:16,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:16,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:16,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:16,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:16,768 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:16,949 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:16,949 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:16,950 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:16,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:16,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:16,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:16,950 INFO L87 Difference]: Start difference. First operand 2314 states and 2684 transitions. Second operand 4 states. [2018-01-30 02:15:17,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:17,145 INFO L93 Difference]: Finished difference Result 4766 states and 5534 transitions. [2018-01-30 02:15:17,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:17,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 322 [2018-01-30 02:15:17,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:17,149 INFO L225 Difference]: With dead ends: 4766 [2018-01-30 02:15:17,149 INFO L226 Difference]: Without dead ends: 2558 [2018-01-30 02:15:17,151 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:15:17,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2018-01-30 02:15:17,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 2356. [2018-01-30 02:15:17,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:17,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2738 transitions. [2018-01-30 02:15:17,174 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2738 transitions. Word has length 322 [2018-01-30 02:15:17,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:17,174 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2738 transitions. [2018-01-30 02:15:17,174 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:17,174 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2738 transitions. [2018-01-30 02:15:17,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:15:17,177 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:17,177 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, 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] [2018-01-30 02:15:17,177 INFO L371 AbstractCegarLoop]: === Iteration 16 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:17,177 INFO L82 PathProgramCache]: Analyzing trace with hash -2073153520, now seen corresponding path program 1 times [2018-01-30 02:15:17,178 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:17,178 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:17,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:17,178 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:17,178 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:17,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:17,189 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:17,561 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:17,561 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:17,561 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:17,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:17,562 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:17,562 INFO L87 Difference]: Start difference. First operand 2356 states and 2738 transitions. Second operand 4 states. [2018-01-30 02:15:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:18,018 INFO L93 Difference]: Finished difference Result 5427 states and 6292 transitions. [2018-01-30 02:15:18,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:18,018 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 325 [2018-01-30 02:15:18,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:18,023 INFO L225 Difference]: With dead ends: 5427 [2018-01-30 02:15:18,023 INFO L226 Difference]: Without dead ends: 3177 [2018-01-30 02:15:18,025 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:15:18,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2018-01-30 02:15:18,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2356. [2018-01-30 02:15:18,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:18,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2735 transitions. [2018-01-30 02:15:18,050 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2735 transitions. Word has length 325 [2018-01-30 02:15:18,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:18,050 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2735 transitions. [2018-01-30 02:15:18,050 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:18,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2735 transitions. [2018-01-30 02:15:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-01-30 02:15:18,053 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:18,053 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, 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] [2018-01-30 02:15:18,053 INFO L371 AbstractCegarLoop]: === Iteration 17 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash -144223852, now seen corresponding path program 1 times [2018-01-30 02:15:18,053 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:18,053 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:18,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,054 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:18,054 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:18,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:18,246 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:18,246 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:18,246 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:18,247 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:18,247 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:18,247 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:18,247 INFO L87 Difference]: Start difference. First operand 2356 states and 2735 transitions. Second operand 4 states. [2018-01-30 02:15:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:18,422 INFO L93 Difference]: Finished difference Result 4806 states and 5578 transitions. [2018-01-30 02:15:18,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:18,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 325 [2018-01-30 02:15:18,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:18,425 INFO L225 Difference]: With dead ends: 4806 [2018-01-30 02:15:18,425 INFO L226 Difference]: Without dead ends: 2556 [2018-01-30 02:15:18,427 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:15:18,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2018-01-30 02:15:18,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2356. [2018-01-30 02:15:18,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:18,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2733 transitions. [2018-01-30 02:15:18,449 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2733 transitions. Word has length 325 [2018-01-30 02:15:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:18,449 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2733 transitions. [2018-01-30 02:15:18,450 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:18,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2733 transitions. [2018-01-30 02:15:18,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-01-30 02:15:18,452 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:18,452 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, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:15:18,452 INFO L371 AbstractCegarLoop]: === Iteration 18 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 395704949, now seen corresponding path program 1 times [2018-01-30 02:15:18,452 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:18,452 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:18,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,453 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:18,453 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:18,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:18,609 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:18,609 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:18,610 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:18,610 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:18,610 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:18,610 INFO L87 Difference]: Start difference. First operand 2356 states and 2733 transitions. Second operand 4 states. [2018-01-30 02:15:18,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:18,914 INFO L93 Difference]: Finished difference Result 5403 states and 6258 transitions. [2018-01-30 02:15:18,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:18,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-01-30 02:15:18,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:18,917 INFO L225 Difference]: With dead ends: 5403 [2018-01-30 02:15:18,917 INFO L226 Difference]: Without dead ends: 3153 [2018-01-30 02:15:18,919 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:15:18,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2018-01-30 02:15:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 2356. [2018-01-30 02:15:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:18,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2730 transitions. [2018-01-30 02:15:18,943 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2730 transitions. Word has length 328 [2018-01-30 02:15:18,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:18,943 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2730 transitions. [2018-01-30 02:15:18,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2730 transitions. [2018-01-30 02:15:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-01-30 02:15:18,946 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:18,946 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, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:15:18,946 INFO L371 AbstractCegarLoop]: === Iteration 19 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1522976143, now seen corresponding path program 1 times [2018-01-30 02:15:18,946 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:18,946 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:18,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:18,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:18,957 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:19,134 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:19,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:19,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:19,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:19,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:19,135 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:19,135 INFO L87 Difference]: Start difference. First operand 2356 states and 2730 transitions. Second operand 4 states. [2018-01-30 02:15:19,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:19,305 INFO L93 Difference]: Finished difference Result 4790 states and 5552 transitions. [2018-01-30 02:15:19,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:19,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 328 [2018-01-30 02:15:19,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:19,308 INFO L225 Difference]: With dead ends: 4790 [2018-01-30 02:15:19,308 INFO L226 Difference]: Without dead ends: 2540 [2018-01-30 02:15:19,310 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:15:19,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2018-01-30 02:15:19,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2356. [2018-01-30 02:15:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:19,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2728 transitions. [2018-01-30 02:15:19,332 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2728 transitions. Word has length 328 [2018-01-30 02:15:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:19,332 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2728 transitions. [2018-01-30 02:15:19,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:19,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2728 transitions. [2018-01-30 02:15:19,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:15:19,335 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:19,335 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:19,335 INFO L371 AbstractCegarLoop]: === Iteration 20 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:19,335 INFO L82 PathProgramCache]: Analyzing trace with hash 946990085, now seen corresponding path program 1 times [2018-01-30 02:15:19,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:19,335 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:19,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:19,336 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:19,336 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:19,367 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:19,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:19,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:19,701 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:19,701 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:19,701 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:19,701 INFO L87 Difference]: Start difference. First operand 2356 states and 2728 transitions. Second operand 4 states. [2018-01-30 02:15:20,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:20,010 INFO L93 Difference]: Finished difference Result 5400 states and 6245 transitions. [2018-01-30 02:15:20,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:20,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-01-30 02:15:20,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:20,013 INFO L225 Difference]: With dead ends: 5400 [2018-01-30 02:15:20,013 INFO L226 Difference]: Without dead ends: 3150 [2018-01-30 02:15:20,015 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:15:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2018-01-30 02:15:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 2356. [2018-01-30 02:15:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:20,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2725 transitions. [2018-01-30 02:15:20,039 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2725 transitions. Word has length 330 [2018-01-30 02:15:20,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:20,039 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2725 transitions. [2018-01-30 02:15:20,039 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:20,039 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2725 transitions. [2018-01-30 02:15:20,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-01-30 02:15:20,041 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:20,041 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:20,042 INFO L371 AbstractCegarLoop]: === Iteration 21 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:20,042 INFO L82 PathProgramCache]: Analyzing trace with hash -364569343, now seen corresponding path program 1 times [2018-01-30 02:15:20,042 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:20,042 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:20,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:20,043 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:20,043 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:20,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:20,262 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:20,262 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:20,263 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:20,263 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:20,263 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:20,263 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:20,263 INFO L87 Difference]: Start difference. First operand 2356 states and 2725 transitions. Second operand 4 states. [2018-01-30 02:15:20,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:20,446 INFO L93 Difference]: Finished difference Result 4788 states and 5540 transitions. [2018-01-30 02:15:20,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:20,447 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-01-30 02:15:20,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:20,449 INFO L225 Difference]: With dead ends: 4788 [2018-01-30 02:15:20,449 INFO L226 Difference]: Without dead ends: 2538 [2018-01-30 02:15:20,451 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:15:20,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2018-01-30 02:15:20,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2356. [2018-01-30 02:15:20,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2356 states. [2018-01-30 02:15:20,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 2723 transitions. [2018-01-30 02:15:20,474 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 2723 transitions. Word has length 330 [2018-01-30 02:15:20,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:20,474 INFO L432 AbstractCegarLoop]: Abstraction has 2356 states and 2723 transitions. [2018-01-30 02:15:20,474 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 2723 transitions. [2018-01-30 02:15:20,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:15:20,476 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:20,476 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:20,476 INFO L371 AbstractCegarLoop]: === Iteration 22 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:20,476 INFO L82 PathProgramCache]: Analyzing trace with hash 515506516, now seen corresponding path program 1 times [2018-01-30 02:15:20,476 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:20,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:20,477 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:20,477 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:20,487 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:20,866 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:20,867 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:20,867 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:20,867 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:20,867 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:20,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:20,867 INFO L87 Difference]: Start difference. First operand 2356 states and 2723 transitions. Second operand 4 states. [2018-01-30 02:15:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:21,107 INFO L93 Difference]: Finished difference Result 4621 states and 5330 transitions. [2018-01-30 02:15:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:21,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:15:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:21,110 INFO L225 Difference]: With dead ends: 4621 [2018-01-30 02:15:21,110 INFO L226 Difference]: Without dead ends: 3147 [2018-01-30 02:15:21,112 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:15:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-01-30 02:15:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2365. [2018-01-30 02:15:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-01-30 02:15:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2732 transitions. [2018-01-30 02:15:21,137 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 2732 transitions. Word has length 333 [2018-01-30 02:15:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:21,137 INFO L432 AbstractCegarLoop]: Abstraction has 2365 states and 2732 transitions. [2018-01-30 02:15:21,137 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2732 transitions. [2018-01-30 02:15:21,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:15:21,139 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:21,139 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:21,140 INFO L371 AbstractCegarLoop]: === Iteration 23 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:21,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1892163904, now seen corresponding path program 1 times [2018-01-30 02:15:21,140 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:21,140 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:21,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:21,140 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:21,140 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:21,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:21,151 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:21,497 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:21,497 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:21,497 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:21,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:21,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:21,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:21,498 INFO L87 Difference]: Start difference. First operand 2365 states and 2732 transitions. Second operand 4 states. [2018-01-30 02:15:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:21,812 INFO L93 Difference]: Finished difference Result 5403 states and 6235 transitions. [2018-01-30 02:15:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:21,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:15:21,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:21,814 INFO L225 Difference]: With dead ends: 5403 [2018-01-30 02:15:21,814 INFO L226 Difference]: Without dead ends: 3144 [2018-01-30 02:15:21,816 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:15:21,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2018-01-30 02:15:21,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2365. [2018-01-30 02:15:21,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2365 states. [2018-01-30 02:15:21,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2365 states to 2365 states and 2729 transitions. [2018-01-30 02:15:21,842 INFO L78 Accepts]: Start accepts. Automaton has 2365 states and 2729 transitions. Word has length 333 [2018-01-30 02:15:21,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:21,842 INFO L432 AbstractCegarLoop]: Abstraction has 2365 states and 2729 transitions. [2018-01-30 02:15:21,842 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:21,842 INFO L276 IsEmpty]: Start isEmpty. Operand 2365 states and 2729 transitions. [2018-01-30 02:15:21,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:15:21,844 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:21,844 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:21,844 INFO L371 AbstractCegarLoop]: === Iteration 24 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:21,844 INFO L82 PathProgramCache]: Analyzing trace with hash -833921320, now seen corresponding path program 1 times [2018-01-30 02:15:21,844 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:21,845 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:21,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:21,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:21,855 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:22,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:22,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:22,079 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:22,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:22,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:22,080 INFO L87 Difference]: Start difference. First operand 2365 states and 2729 transitions. Second operand 4 states. [2018-01-30 02:15:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:22,251 INFO L93 Difference]: Finished difference Result 4025 states and 4642 transitions. [2018-01-30 02:15:22,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:22,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:15:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:22,253 INFO L225 Difference]: With dead ends: 4025 [2018-01-30 02:15:22,253 INFO L226 Difference]: Without dead ends: 2545 [2018-01-30 02:15:22,254 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:15:22,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2545 states. [2018-01-30 02:15:22,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2545 to 2371. [2018-01-30 02:15:22,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2018-01-30 02:15:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2735 transitions. [2018-01-30 02:15:22,276 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2735 transitions. Word has length 333 [2018-01-30 02:15:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:22,276 INFO L432 AbstractCegarLoop]: Abstraction has 2371 states and 2735 transitions. [2018-01-30 02:15:22,276 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:22,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2735 transitions. [2018-01-30 02:15:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-01-30 02:15:22,278 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:22,279 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:22,279 INFO L371 AbstractCegarLoop]: === Iteration 25 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1053375556, now seen corresponding path program 1 times [2018-01-30 02:15:22,279 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:22,279 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:22,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:22,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:22,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:22,289 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:22,480 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:22,480 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:22,480 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:22,480 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:22,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:22,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:22,481 INFO L87 Difference]: Start difference. First operand 2371 states and 2735 transitions. Second operand 4 states. [2018-01-30 02:15:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:22,713 INFO L93 Difference]: Finished difference Result 4808 states and 5548 transitions. [2018-01-30 02:15:22,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:22,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 333 [2018-01-30 02:15:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:22,715 INFO L225 Difference]: With dead ends: 4808 [2018-01-30 02:15:22,715 INFO L226 Difference]: Without dead ends: 2543 [2018-01-30 02:15:22,717 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:15:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2543 states. [2018-01-30 02:15:22,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2543 to 2371. [2018-01-30 02:15:22,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2018-01-30 02:15:22,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2733 transitions. [2018-01-30 02:15:22,743 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2733 transitions. Word has length 333 [2018-01-30 02:15:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:22,743 INFO L432 AbstractCegarLoop]: Abstraction has 2371 states and 2733 transitions. [2018-01-30 02:15:22,743 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2733 transitions. [2018-01-30 02:15:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-01-30 02:15:22,745 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:22,746 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:22,746 INFO L371 AbstractCegarLoop]: === Iteration 26 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:22,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1666812289, now seen corresponding path program 1 times [2018-01-30 02:15:22,746 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:22,746 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:22,746 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:22,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:22,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:22,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:22,755 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:23,026 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:23,026 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:23,027 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:23,027 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:23,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:23,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:23,027 INFO L87 Difference]: Start difference. First operand 2371 states and 2733 transitions. Second operand 6 states. [2018-01-30 02:15:23,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:23,777 INFO L93 Difference]: Finished difference Result 7999 states and 9119 transitions. [2018-01-30 02:15:23,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:23,778 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 335 [2018-01-30 02:15:23,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:23,781 INFO L225 Difference]: With dead ends: 7999 [2018-01-30 02:15:23,781 INFO L226 Difference]: Without dead ends: 5734 [2018-01-30 02:15:23,783 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5734 states. [2018-01-30 02:15:23,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5734 to 2371. [2018-01-30 02:15:23,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2018-01-30 02:15:23,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2730 transitions. [2018-01-30 02:15:23,816 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2730 transitions. Word has length 335 [2018-01-30 02:15:23,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:23,816 INFO L432 AbstractCegarLoop]: Abstraction has 2371 states and 2730 transitions. [2018-01-30 02:15:23,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:23,817 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2730 transitions. [2018-01-30 02:15:23,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-01-30 02:15:23,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:23,819 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, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:23,819 INFO L371 AbstractCegarLoop]: === Iteration 27 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1386839293, now seen corresponding path program 1 times [2018-01-30 02:15:23,819 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:23,819 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:23,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:23,820 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:23,820 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:23,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:24,033 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:24,033 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:24,033 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:24,034 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:24,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:24,034 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:24,034 INFO L87 Difference]: Start difference. First operand 2371 states and 2730 transitions. Second operand 6 states. [2018-01-30 02:15:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:24,541 INFO L93 Difference]: Finished difference Result 7081 states and 8130 transitions. [2018-01-30 02:15:24,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:24,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 335 [2018-01-30 02:15:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:24,544 INFO L225 Difference]: With dead ends: 7081 [2018-01-30 02:15:24,544 INFO L226 Difference]: Without dead ends: 4816 [2018-01-30 02:15:24,546 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:15:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2018-01-30 02:15:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 2371. [2018-01-30 02:15:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2018-01-30 02:15:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2728 transitions. [2018-01-30 02:15:24,599 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2728 transitions. Word has length 335 [2018-01-30 02:15:24,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:24,599 INFO L432 AbstractCegarLoop]: Abstraction has 2371 states and 2728 transitions. [2018-01-30 02:15:24,599 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:24,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2728 transitions. [2018-01-30 02:15:24,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-01-30 02:15:24,601 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:24,602 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,602 INFO L371 AbstractCegarLoop]: === Iteration 28 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:24,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1310662173, now seen corresponding path program 1 times [2018-01-30 02:15:24,602 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:24,602 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:24,602 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:24,603 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:24,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:24,613 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:24,892 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:24,892 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:24,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:24,893 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:24,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:24,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:24,893 INFO L87 Difference]: Start difference. First operand 2371 states and 2728 transitions. Second operand 4 states. [2018-01-30 02:15:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:25,140 INFO L93 Difference]: Finished difference Result 5412 states and 6224 transitions. [2018-01-30 02:15:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:25,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-01-30 02:15:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:25,142 INFO L225 Difference]: With dead ends: 5412 [2018-01-30 02:15:25,142 INFO L226 Difference]: Without dead ends: 3147 [2018-01-30 02:15:25,144 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:15:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2018-01-30 02:15:25,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 2371. [2018-01-30 02:15:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2371 states. [2018-01-30 02:15:25,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 2725 transitions. [2018-01-30 02:15:25,173 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 2725 transitions. Word has length 336 [2018-01-30 02:15:25,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:25,173 INFO L432 AbstractCegarLoop]: Abstraction has 2371 states and 2725 transitions. [2018-01-30 02:15:25,173 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:25,173 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 2725 transitions. [2018-01-30 02:15:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-01-30 02:15:25,175 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:25,176 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, 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, 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] [2018-01-30 02:15:25,176 INFO L371 AbstractCegarLoop]: === Iteration 29 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 384751537, now seen corresponding path program 1 times [2018-01-30 02:15:25,176 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:25,176 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:25,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:25,177 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:25,177 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:25,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:25,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:25,399 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:25,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:25,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:25,399 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:25,399 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:25,399 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:25,399 INFO L87 Difference]: Start difference. First operand 2371 states and 2725 transitions. Second operand 4 states. [2018-01-30 02:15:25,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:25,697 INFO L93 Difference]: Finished difference Result 4627 states and 5312 transitions. [2018-01-30 02:15:25,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:25,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-01-30 02:15:25,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:25,699 INFO L225 Difference]: With dead ends: 4627 [2018-01-30 02:15:25,699 INFO L226 Difference]: Without dead ends: 3144 [2018-01-30 02:15:25,701 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:15:25,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2018-01-30 02:15:25,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2380. [2018-01-30 02:15:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-01-30 02:15:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 2734 transitions. [2018-01-30 02:15:25,733 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 2734 transitions. Word has length 336 [2018-01-30 02:15:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:25,733 INFO L432 AbstractCegarLoop]: Abstraction has 2380 states and 2734 transitions. [2018-01-30 02:15:25,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:25,733 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2734 transitions. [2018-01-30 02:15:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-01-30 02:15:25,735 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:25,735 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:25,735 INFO L371 AbstractCegarLoop]: === Iteration 30 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1399890457, now seen corresponding path program 1 times [2018-01-30 02:15:25,735 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:25,735 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:25,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:25,736 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:25,736 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:25,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:25,746 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:25,912 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:25,913 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:25,913 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:25,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:25,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:25,913 INFO L87 Difference]: Start difference. First operand 2380 states and 2734 transitions. Second operand 4 states. [2018-01-30 02:15:26,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:26,090 INFO L93 Difference]: Finished difference Result 4824 states and 5544 transitions. [2018-01-30 02:15:26,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:26,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-01-30 02:15:26,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:26,091 INFO L225 Difference]: With dead ends: 4824 [2018-01-30 02:15:26,091 INFO L226 Difference]: Without dead ends: 2550 [2018-01-30 02:15:26,093 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:15:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2550 states. [2018-01-30 02:15:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2550 to 2380. [2018-01-30 02:15:26,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2380 states. [2018-01-30 02:15:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2380 states to 2380 states and 2732 transitions. [2018-01-30 02:15:26,127 INFO L78 Accepts]: Start accepts. Automaton has 2380 states and 2732 transitions. Word has length 336 [2018-01-30 02:15:26,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:26,127 INFO L432 AbstractCegarLoop]: Abstraction has 2380 states and 2732 transitions. [2018-01-30 02:15:26,127 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:26,127 INFO L276 IsEmpty]: Start isEmpty. Operand 2380 states and 2732 transitions. [2018-01-30 02:15:26,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-01-30 02:15:26,129 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:26,129 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, 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, 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] [2018-01-30 02:15:26,129 INFO L371 AbstractCegarLoop]: === Iteration 31 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:26,129 INFO L82 PathProgramCache]: Analyzing trace with hash 473979821, now seen corresponding path program 1 times [2018-01-30 02:15:26,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:26,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:26,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:26,130 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:26,130 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:26,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:26,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 197 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:26,313 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:26,313 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:26,314 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:26,314 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:26,314 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:26,314 INFO L87 Difference]: Start difference. First operand 2380 states and 2732 transitions. Second operand 4 states. [2018-01-30 02:15:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:26,489 INFO L93 Difference]: Finished difference Result 4037 states and 4633 transitions. [2018-01-30 02:15:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:26,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 336 [2018-01-30 02:15:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:26,491 INFO L225 Difference]: With dead ends: 4037 [2018-01-30 02:15:26,491 INFO L226 Difference]: Without dead ends: 2548 [2018-01-30 02:15:26,492 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:15:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2548 states. [2018-01-30 02:15:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2548 to 2386. [2018-01-30 02:15:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-01-30 02:15:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2738 transitions. [2018-01-30 02:15:26,521 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2738 transitions. Word has length 336 [2018-01-30 02:15:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:26,522 INFO L432 AbstractCegarLoop]: Abstraction has 2386 states and 2738 transitions. [2018-01-30 02:15:26,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:26,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2738 transitions. [2018-01-30 02:15:26,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-01-30 02:15:26,524 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:26,524 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:26,524 INFO L371 AbstractCegarLoop]: === Iteration 32 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash 207561502, now seen corresponding path program 1 times [2018-01-30 02:15:26,524 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:26,524 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:26,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:26,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:26,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:26,535 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:26,948 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:26,948 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:26,948 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:26,948 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:26,948 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:26,949 INFO L87 Difference]: Start difference. First operand 2386 states and 2738 transitions. Second operand 6 states. [2018-01-30 02:15:27,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:27,573 INFO L93 Difference]: Finished difference Result 7939 states and 9020 transitions. [2018-01-30 02:15:27,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:27,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-01-30 02:15:27,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:27,575 INFO L225 Difference]: With dead ends: 7939 [2018-01-30 02:15:27,576 INFO L226 Difference]: Without dead ends: 5659 [2018-01-30 02:15:27,577 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2018-01-30 02:15:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 2386. [2018-01-30 02:15:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-01-30 02:15:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2735 transitions. [2018-01-30 02:15:27,616 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2735 transitions. Word has length 337 [2018-01-30 02:15:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:27,616 INFO L432 AbstractCegarLoop]: Abstraction has 2386 states and 2735 transitions. [2018-01-30 02:15:27,616 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2735 transitions. [2018-01-30 02:15:27,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-01-30 02:15:27,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:27,618 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:27,619 INFO L371 AbstractCegarLoop]: === Iteration 33 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash -1321328990, now seen corresponding path program 1 times [2018-01-30 02:15:27,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:27,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:27,619 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:27,619 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:27,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:27,629 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:28,130 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:28,130 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:28,130 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:28,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:28,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:28,130 INFO L87 Difference]: Start difference. First operand 2386 states and 2735 transitions. Second operand 6 states. [2018-01-30 02:15:28,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:28,554 INFO L93 Difference]: Finished difference Result 7051 states and 8064 transitions. [2018-01-30 02:15:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:28,554 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2018-01-30 02:15:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:28,557 INFO L225 Difference]: With dead ends: 7051 [2018-01-30 02:15:28,557 INFO L226 Difference]: Without dead ends: 4771 [2018-01-30 02:15:28,559 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:15:28,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4771 states. [2018-01-30 02:15:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4771 to 2386. [2018-01-30 02:15:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-01-30 02:15:28,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2733 transitions. [2018-01-30 02:15:28,597 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2733 transitions. Word has length 337 [2018-01-30 02:15:28,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:28,597 INFO L432 AbstractCegarLoop]: Abstraction has 2386 states and 2733 transitions. [2018-01-30 02:15:28,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2733 transitions. [2018-01-30 02:15:28,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 02:15:28,599 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:28,599 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, 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] [2018-01-30 02:15:28,599 INFO L371 AbstractCegarLoop]: === Iteration 34 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:28,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1224284929, now seen corresponding path program 1 times [2018-01-30 02:15:28,599 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:28,600 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:28,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:28,600 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:28,600 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:28,609 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:28,823 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:28,824 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:28,824 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:28,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:28,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:28,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:28,824 INFO L87 Difference]: Start difference. First operand 2386 states and 2733 transitions. Second operand 6 states. [2018-01-30 02:15:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:29,443 INFO L93 Difference]: Finished difference Result 7936 states and 9007 transitions. [2018-01-30 02:15:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:29,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 338 [2018-01-30 02:15:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:29,446 INFO L225 Difference]: With dead ends: 7936 [2018-01-30 02:15:29,446 INFO L226 Difference]: Without dead ends: 5656 [2018-01-30 02:15:29,449 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:15:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5656 states. [2018-01-30 02:15:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5656 to 2386. [2018-01-30 02:15:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-01-30 02:15:29,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2730 transitions. [2018-01-30 02:15:29,492 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2730 transitions. Word has length 338 [2018-01-30 02:15:29,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:29,493 INFO L432 AbstractCegarLoop]: Abstraction has 2386 states and 2730 transitions. [2018-01-30 02:15:29,493 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:29,493 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2730 transitions. [2018-01-30 02:15:29,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-01-30 02:15:29,495 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:29,495 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, 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] [2018-01-30 02:15:29,495 INFO L371 AbstractCegarLoop]: === Iteration 35 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:29,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1375249925, now seen corresponding path program 1 times [2018-01-30 02:15:29,495 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:29,495 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:29,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:29,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:29,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:29,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:29,504 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:29,755 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:29,756 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:29,756 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:29,756 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:29,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:29,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:29,756 INFO L87 Difference]: Start difference. First operand 2386 states and 2730 transitions. Second operand 6 states. [2018-01-30 02:15:30,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:30,336 INFO L93 Difference]: Finished difference Result 7049 states and 8052 transitions. [2018-01-30 02:15:30,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:30,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 338 [2018-01-30 02:15:30,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:30,339 INFO L225 Difference]: With dead ends: 7049 [2018-01-30 02:15:30,339 INFO L226 Difference]: Without dead ends: 4769 [2018-01-30 02:15:30,341 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:30,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2018-01-30 02:15:30,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 2386. [2018-01-30 02:15:30,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2386 states. [2018-01-30 02:15:30,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 2728 transitions. [2018-01-30 02:15:30,384 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 2728 transitions. Word has length 338 [2018-01-30 02:15:30,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:30,384 INFO L432 AbstractCegarLoop]: Abstraction has 2386 states and 2728 transitions. [2018-01-30 02:15:30,384 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:30,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 2728 transitions. [2018-01-30 02:15:30,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-01-30 02:15:30,386 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:30,386 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, 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, 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] [2018-01-30 02:15:30,386 INFO L371 AbstractCegarLoop]: === Iteration 36 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash -902265300, now seen corresponding path program 1 times [2018-01-30 02:15:30,386 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:30,387 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:30,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:30,387 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:30,387 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:30,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:30,584 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:30,584 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:30,584 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:30,585 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:30,585 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:30,585 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:30,585 INFO L87 Difference]: Start difference. First operand 2386 states and 2728 transitions. Second operand 4 states. [2018-01-30 02:15:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:30,854 INFO L93 Difference]: Finished difference Result 4617 states and 5279 transitions. [2018-01-30 02:15:30,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:30,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2018-01-30 02:15:30,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:30,856 INFO L225 Difference]: With dead ends: 4617 [2018-01-30 02:15:30,856 INFO L226 Difference]: Without dead ends: 3125 [2018-01-30 02:15:30,858 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:15:30,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2018-01-30 02:15:30,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2395. [2018-01-30 02:15:30,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-01-30 02:15:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2737 transitions. [2018-01-30 02:15:30,897 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2737 transitions. Word has length 339 [2018-01-30 02:15:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:30,897 INFO L432 AbstractCegarLoop]: Abstraction has 2395 states and 2737 transitions. [2018-01-30 02:15:30,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2737 transitions. [2018-01-30 02:15:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-01-30 02:15:30,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:30,899 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:30,899 INFO L371 AbstractCegarLoop]: === Iteration 37 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:30,899 INFO L82 PathProgramCache]: Analyzing trace with hash -937740904, now seen corresponding path program 1 times [2018-01-30 02:15:30,899 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:30,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:30,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:30,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:30,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:30,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:31,079 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:31,079 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:31,080 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:31,080 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:31,080 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:31,080 INFO L87 Difference]: Start difference. First operand 2395 states and 2737 transitions. Second operand 4 states. [2018-01-30 02:15:31,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:31,375 INFO L93 Difference]: Finished difference Result 5327 states and 6096 transitions. [2018-01-30 02:15:31,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:31,375 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2018-01-30 02:15:31,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:31,377 INFO L225 Difference]: With dead ends: 5327 [2018-01-30 02:15:31,377 INFO L226 Difference]: Without dead ends: 3038 [2018-01-30 02:15:31,379 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:15:31,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2018-01-30 02:15:31,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2395. [2018-01-30 02:15:31,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-01-30 02:15:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2734 transitions. [2018-01-30 02:15:31,418 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2734 transitions. Word has length 339 [2018-01-30 02:15:31,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:31,418 INFO L432 AbstractCegarLoop]: Abstraction has 2395 states and 2734 transitions. [2018-01-30 02:15:31,418 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:31,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2734 transitions. [2018-01-30 02:15:31,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-01-30 02:15:31,419 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:31,419 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, 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, 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] [2018-01-30 02:15:31,420 INFO L371 AbstractCegarLoop]: === Iteration 38 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:31,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1287212880, now seen corresponding path program 1 times [2018-01-30 02:15:31,420 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:31,420 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:31,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:31,420 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:31,420 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:31,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:31,590 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:31,591 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:31,591 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:31,591 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:31,591 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:31,591 INFO L87 Difference]: Start difference. First operand 2395 states and 2734 transitions. Second operand 4 states. [2018-01-30 02:15:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:31,774 INFO L93 Difference]: Finished difference Result 4036 states and 4608 transitions. [2018-01-30 02:15:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:31,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2018-01-30 02:15:31,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:31,775 INFO L225 Difference]: With dead ends: 4036 [2018-01-30 02:15:31,776 INFO L226 Difference]: Without dead ends: 2538 [2018-01-30 02:15:31,777 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:15:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2018-01-30 02:15:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2401. [2018-01-30 02:15:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:31,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2740 transitions. [2018-01-30 02:15:31,815 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2740 transitions. Word has length 339 [2018-01-30 02:15:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:31,815 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2740 transitions. [2018-01-30 02:15:31,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2740 transitions. [2018-01-30 02:15:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-01-30 02:15:31,817 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:31,817 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 02:15:31,817 INFO L371 AbstractCegarLoop]: === Iteration 39 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1322688484, now seen corresponding path program 1 times [2018-01-30 02:15:31,817 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:31,817 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:31,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:31,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:31,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:31,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:31,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:31,975 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:31,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:31,975 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:31,975 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:31,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:31,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:31,976 INFO L87 Difference]: Start difference. First operand 2401 states and 2740 transitions. Second operand 4 states. [2018-01-30 02:15:32,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:32,177 INFO L93 Difference]: Finished difference Result 4775 states and 5456 transitions. [2018-01-30 02:15:32,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:32,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 339 [2018-01-30 02:15:32,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:32,178 INFO L225 Difference]: With dead ends: 4775 [2018-01-30 02:15:32,178 INFO L226 Difference]: Without dead ends: 2480 [2018-01-30 02:15:32,179 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:15:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2018-01-30 02:15:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2401. [2018-01-30 02:15:32,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:32,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2738 transitions. [2018-01-30 02:15:32,216 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2738 transitions. Word has length 339 [2018-01-30 02:15:32,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:32,217 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2738 transitions. [2018-01-30 02:15:32,217 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:32,217 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2738 transitions. [2018-01-30 02:15:32,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-01-30 02:15:32,218 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:32,218 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:32,218 INFO L371 AbstractCegarLoop]: === Iteration 40 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:32,218 INFO L82 PathProgramCache]: Analyzing trace with hash 272460582, now seen corresponding path program 1 times [2018-01-30 02:15:32,219 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:32,219 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:32,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:32,219 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:32,219 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:32,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:15:32,402 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:32,403 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:32,403 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:32,403 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:32,403 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:32,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:32,403 INFO L87 Difference]: Start difference. First operand 2401 states and 2738 transitions. Second operand 6 states. [2018-01-30 02:15:32,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:32,992 INFO L93 Difference]: Finished difference Result 7830 states and 8864 transitions. [2018-01-30 02:15:32,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:32,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 341 [2018-01-30 02:15:32,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:32,996 INFO L225 Difference]: With dead ends: 7830 [2018-01-30 02:15:32,996 INFO L226 Difference]: Without dead ends: 5535 [2018-01-30 02:15:32,998 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:15:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2018-01-30 02:15:33,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 2401. [2018-01-30 02:15:33,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:33,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2735 transitions. [2018-01-30 02:15:33,046 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2735 transitions. Word has length 341 [2018-01-30 02:15:33,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:33,046 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2735 transitions. [2018-01-30 02:15:33,046 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:33,046 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2735 transitions. [2018-01-30 02:15:33,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-01-30 02:15:33,047 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:33,047 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, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:33,048 INFO L371 AbstractCegarLoop]: === Iteration 41 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:33,048 INFO L82 PathProgramCache]: Analyzing trace with hash -294976342, now seen corresponding path program 1 times [2018-01-30 02:15:33,048 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:33,048 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:33,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:33,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:33,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:33,056 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:33,242 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:33,242 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:33,242 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:33,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:33,243 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:33,243 INFO L87 Difference]: Start difference. First operand 2401 states and 2735 transitions. Second operand 6 states. [2018-01-30 02:15:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:33,780 INFO L93 Difference]: Finished difference Result 6986 states and 7954 transitions. [2018-01-30 02:15:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:33,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 341 [2018-01-30 02:15:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:33,783 INFO L225 Difference]: With dead ends: 6986 [2018-01-30 02:15:33,783 INFO L226 Difference]: Without dead ends: 4691 [2018-01-30 02:15:33,786 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:15:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2018-01-30 02:15:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 2401. [2018-01-30 02:15:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:33,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2733 transitions. [2018-01-30 02:15:33,840 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2733 transitions. Word has length 341 [2018-01-30 02:15:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:33,840 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2733 transitions. [2018-01-30 02:15:33,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:33,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2733 transitions. [2018-01-30 02:15:33,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-01-30 02:15:33,842 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:33,842 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:33,842 INFO L371 AbstractCegarLoop]: === Iteration 42 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:33,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1526729610, now seen corresponding path program 1 times [2018-01-30 02:15:33,842 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:33,842 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:33,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:33,843 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:33,843 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:33,851 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:34,044 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:34,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:34,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:34,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:34,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:34,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:34,045 INFO L87 Difference]: Start difference. First operand 2401 states and 2733 transitions. Second operand 6 states. [2018-01-30 02:15:34,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:34,882 INFO L93 Difference]: Finished difference Result 7827 states and 8851 transitions. [2018-01-30 02:15:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:34,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 343 [2018-01-30 02:15:34,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:34,892 INFO L225 Difference]: With dead ends: 7827 [2018-01-30 02:15:34,893 INFO L226 Difference]: Without dead ends: 5532 [2018-01-30 02:15:34,895 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:15:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2018-01-30 02:15:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 2401. [2018-01-30 02:15:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:34,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2730 transitions. [2018-01-30 02:15:34,948 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2730 transitions. Word has length 343 [2018-01-30 02:15:34,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:34,948 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2730 transitions. [2018-01-30 02:15:34,948 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2730 transitions. [2018-01-30 02:15:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-01-30 02:15:34,950 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:34,950 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:34,950 INFO L371 AbstractCegarLoop]: === Iteration 43 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:34,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1372766982, now seen corresponding path program 1 times [2018-01-30 02:15:34,950 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:34,951 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:34,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:34,951 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:34,951 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:34,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:35,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:35,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:35,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:35,170 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:35,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:35,170 INFO L87 Difference]: Start difference. First operand 2401 states and 2730 transitions. Second operand 6 states. [2018-01-30 02:15:35,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:35,834 INFO L93 Difference]: Finished difference Result 6984 states and 7942 transitions. [2018-01-30 02:15:35,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:35,835 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 343 [2018-01-30 02:15:35,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:35,837 INFO L225 Difference]: With dead ends: 6984 [2018-01-30 02:15:35,837 INFO L226 Difference]: Without dead ends: 4689 [2018-01-30 02:15:35,840 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:15:35,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4689 states. [2018-01-30 02:15:35,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4689 to 2401. [2018-01-30 02:15:35,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:35,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2728 transitions. [2018-01-30 02:15:35,896 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2728 transitions. Word has length 343 [2018-01-30 02:15:35,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:35,897 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2728 transitions. [2018-01-30 02:15:35,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:35,897 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2728 transitions. [2018-01-30 02:15:35,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-30 02:15:35,898 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:35,898 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, 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, 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] [2018-01-30 02:15:35,898 INFO L371 AbstractCegarLoop]: === Iteration 44 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:35,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1019062461, now seen corresponding path program 1 times [2018-01-30 02:15:35,898 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:35,899 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:35,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:35,899 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:35,899 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:35,907 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:36,068 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:36,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:36,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:36,069 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:36,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:36,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:36,069 INFO L87 Difference]: Start difference. First operand 2401 states and 2728 transitions. Second operand 6 states. [2018-01-30 02:15:36,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:36,819 INFO L93 Difference]: Finished difference Result 7030 states and 7934 transitions. [2018-01-30 02:15:36,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:36,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 346 [2018-01-30 02:15:36,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:36,822 INFO L225 Difference]: With dead ends: 7030 [2018-01-30 02:15:36,822 INFO L226 Difference]: Without dead ends: 5529 [2018-01-30 02:15:36,824 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:15:36,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5529 states. [2018-01-30 02:15:36,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5529 to 2401. [2018-01-30 02:15:36,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2725 transitions. [2018-01-30 02:15:36,878 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2725 transitions. Word has length 346 [2018-01-30 02:15:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:36,878 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2725 transitions. [2018-01-30 02:15:36,878 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2725 transitions. [2018-01-30 02:15:36,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-30 02:15:36,880 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:36,880 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:36,880 INFO L371 AbstractCegarLoop]: === Iteration 45 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:36,880 INFO L82 PathProgramCache]: Analyzing trace with hash 868234415, now seen corresponding path program 1 times [2018-01-30 02:15:36,880 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:36,880 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:36,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:36,881 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:36,881 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:36,889 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:37,039 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:37,039 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:37,039 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:37,040 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:37,040 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:37,040 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:37,040 INFO L87 Difference]: Start difference. First operand 2401 states and 2725 transitions. Second operand 6 states. [2018-01-30 02:15:37,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:37,707 INFO L93 Difference]: Finished difference Result 7821 states and 8829 transitions. [2018-01-30 02:15:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:37,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 346 [2018-01-30 02:15:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:37,710 INFO L225 Difference]: With dead ends: 7821 [2018-01-30 02:15:37,710 INFO L226 Difference]: Without dead ends: 5526 [2018-01-30 02:15:37,712 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:15:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5526 states. [2018-01-30 02:15:37,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5526 to 2401. [2018-01-30 02:15:37,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:37,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2722 transitions. [2018-01-30 02:15:37,771 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2722 transitions. Word has length 346 [2018-01-30 02:15:37,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:37,771 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2722 transitions. [2018-01-30 02:15:37,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:37,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2722 transitions. [2018-01-30 02:15:37,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-30 02:15:37,772 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:37,772 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, 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, 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] [2018-01-30 02:15:37,773 INFO L371 AbstractCegarLoop]: === Iteration 46 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:37,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1343483841, now seen corresponding path program 1 times [2018-01-30 02:15:37,773 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:37,773 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:37,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:37,773 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:37,773 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:37,781 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:37,975 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:37,975 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:37,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:37,976 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:37,976 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:37,976 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:37,976 INFO L87 Difference]: Start difference. First operand 2401 states and 2722 transitions. Second operand 6 states. [2018-01-30 02:15:38,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:38,514 INFO L93 Difference]: Finished difference Result 6188 states and 7022 transitions. [2018-01-30 02:15:38,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:38,515 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 346 [2018-01-30 02:15:38,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:38,517 INFO L225 Difference]: With dead ends: 6188 [2018-01-30 02:15:38,517 INFO L226 Difference]: Without dead ends: 4687 [2018-01-30 02:15:38,518 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:15:38,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4687 states. [2018-01-30 02:15:38,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4687 to 2401. [2018-01-30 02:15:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:38,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2720 transitions. [2018-01-30 02:15:38,576 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2720 transitions. Word has length 346 [2018-01-30 02:15:38,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:38,576 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2720 transitions. [2018-01-30 02:15:38,576 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:38,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2720 transitions. [2018-01-30 02:15:38,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-01-30 02:15:38,577 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:38,578 INFO L350 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:38,578 INFO L371 AbstractCegarLoop]: === Iteration 47 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:38,578 INFO L82 PathProgramCache]: Analyzing trace with hash 543813035, now seen corresponding path program 1 times [2018-01-30 02:15:38,578 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:38,578 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:38,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:38,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:38,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:38,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:38,766 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:38,767 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:38,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:38,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:38,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:38,767 INFO L87 Difference]: Start difference. First operand 2401 states and 2720 transitions. Second operand 6 states. [2018-01-30 02:15:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:39,310 INFO L93 Difference]: Finished difference Result 6980 states and 7918 transitions. [2018-01-30 02:15:39,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:39,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 346 [2018-01-30 02:15:39,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:39,313 INFO L225 Difference]: With dead ends: 6980 [2018-01-30 02:15:39,313 INFO L226 Difference]: Without dead ends: 4685 [2018-01-30 02:15:39,315 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:15:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4685 states. [2018-01-30 02:15:39,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4685 to 2401. [2018-01-30 02:15:39,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2401 states. [2018-01-30 02:15:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2401 states to 2401 states and 2718 transitions. [2018-01-30 02:15:39,375 INFO L78 Accepts]: Start accepts. Automaton has 2401 states and 2718 transitions. Word has length 346 [2018-01-30 02:15:39,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:39,375 INFO L432 AbstractCegarLoop]: Abstraction has 2401 states and 2718 transitions. [2018-01-30 02:15:39,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:39,375 INFO L276 IsEmpty]: Start isEmpty. Operand 2401 states and 2718 transitions. [2018-01-30 02:15:39,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:39,376 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:39,376 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,376 INFO L371 AbstractCegarLoop]: === Iteration 48 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash 362622674, now seen corresponding path program 1 times [2018-01-30 02:15:39,377 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:39,377 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:39,377 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:39,377 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:39,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:39,556 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:39,556 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:39,557 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:39,557 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:39,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:39,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:39,557 INFO L87 Difference]: Start difference. First operand 2401 states and 2718 transitions. Second operand 4 states. [2018-01-30 02:15:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:39,856 INFO L93 Difference]: Finished difference Result 5336 states and 6055 transitions. [2018-01-30 02:15:39,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:39,856 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 349 [2018-01-30 02:15:39,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:39,858 INFO L225 Difference]: With dead ends: 5336 [2018-01-30 02:15:39,858 INFO L226 Difference]: Without dead ends: 3041 [2018-01-30 02:15:39,860 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:15:39,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2018-01-30 02:15:39,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2428. [2018-01-30 02:15:39,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-01-30 02:15:39,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2751 transitions. [2018-01-30 02:15:39,917 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2751 transitions. Word has length 349 [2018-01-30 02:15:39,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:39,917 INFO L432 AbstractCegarLoop]: Abstraction has 2428 states and 2751 transitions. [2018-01-30 02:15:39,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:39,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2751 transitions. [2018-01-30 02:15:39,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:39,918 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:39,919 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:39,919 INFO L371 AbstractCegarLoop]: === Iteration 49 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:39,919 INFO L82 PathProgramCache]: Analyzing trace with hash 598166990, now seen corresponding path program 1 times [2018-01-30 02:15:39,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:39,919 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:39,919 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:39,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:39,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:39,928 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:40,103 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:40,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:40,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:40,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:40,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:40,104 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:40,104 INFO L87 Difference]: Start difference. First operand 2428 states and 2751 transitions. Second operand 6 states. [2018-01-30 02:15:40,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:40,755 INFO L93 Difference]: Finished difference Result 7869 states and 8872 transitions. [2018-01-30 02:15:40,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:40,756 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-01-30 02:15:40,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:40,759 INFO L225 Difference]: With dead ends: 7869 [2018-01-30 02:15:40,759 INFO L226 Difference]: Without dead ends: 5547 [2018-01-30 02:15:40,761 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:15:40,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2018-01-30 02:15:40,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 2428. [2018-01-30 02:15:40,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-01-30 02:15:40,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2748 transitions. [2018-01-30 02:15:40,835 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2748 transitions. Word has length 349 [2018-01-30 02:15:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:40,835 INFO L432 AbstractCegarLoop]: Abstraction has 2428 states and 2748 transitions. [2018-01-30 02:15:40,835 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2748 transitions. [2018-01-30 02:15:40,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:40,837 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:40,837 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:40,837 INFO L371 AbstractCegarLoop]: === Iteration 50 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:40,837 INFO L82 PathProgramCache]: Analyzing trace with hash -327743646, now seen corresponding path program 1 times [2018-01-30 02:15:40,837 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:40,837 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:40,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:40,838 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:40,838 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:40,847 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:41,069 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:41,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:41,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:41,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:41,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:41,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:41,070 INFO L87 Difference]: Start difference. First operand 2428 states and 2748 transitions. Second operand 6 states. [2018-01-30 02:15:41,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:41,749 INFO L93 Difference]: Finished difference Result 7063 states and 7953 transitions. [2018-01-30 02:15:41,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:41,749 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-01-30 02:15:41,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:41,752 INFO L225 Difference]: With dead ends: 7063 [2018-01-30 02:15:41,752 INFO L226 Difference]: Without dead ends: 5544 [2018-01-30 02:15:41,754 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:15:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5544 states. [2018-01-30 02:15:41,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5544 to 2428. [2018-01-30 02:15:41,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2018-01-30 02:15:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 2745 transitions. [2018-01-30 02:15:41,828 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 2745 transitions. Word has length 349 [2018-01-30 02:15:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:41,828 INFO L432 AbstractCegarLoop]: Abstraction has 2428 states and 2745 transitions. [2018-01-30 02:15:41,828 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:41,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 2745 transitions. [2018-01-30 02:15:41,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:41,830 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:41,830 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:41,830 INFO L371 AbstractCegarLoop]: === Iteration 51 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:41,830 INFO L82 PathProgramCache]: Analyzing trace with hash -798292906, now seen corresponding path program 1 times [2018-01-30 02:15:41,830 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:41,830 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:41,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:41,831 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:41,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:41,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:41,977 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:41,977 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:41,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:41,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:41,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:41,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:41,978 INFO L87 Difference]: Start difference. First operand 2428 states and 2745 transitions. Second operand 4 states. [2018-01-30 02:15:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:42,220 INFO L93 Difference]: Finished difference Result 5279 states and 5983 transitions. [2018-01-30 02:15:42,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:15:42,220 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 349 [2018-01-30 02:15:42,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:42,222 INFO L225 Difference]: With dead ends: 5279 [2018-01-30 02:15:42,222 INFO L226 Difference]: Without dead ends: 2957 [2018-01-30 02:15:42,224 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:15:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2957 states. [2018-01-30 02:15:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2957 to 2647. [2018-01-30 02:15:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-01-30 02:15:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3021 transitions. [2018-01-30 02:15:42,290 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3021 transitions. Word has length 349 [2018-01-30 02:15:42,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:42,290 INFO L432 AbstractCegarLoop]: Abstraction has 2647 states and 3021 transitions. [2018-01-30 02:15:42,290 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:42,290 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3021 transitions. [2018-01-30 02:15:42,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:42,292 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:42,292 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:42,292 INFO L371 AbstractCegarLoop]: === Iteration 52 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:42,292 INFO L82 PathProgramCache]: Analyzing trace with hash -562748590, now seen corresponding path program 1 times [2018-01-30 02:15:42,292 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:42,292 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:42,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:42,293 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:42,293 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:42,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:42,489 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:42,489 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:42,490 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:42,490 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:42,490 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:42,490 INFO L87 Difference]: Start difference. First operand 2647 states and 3021 transitions. Second operand 6 states. [2018-01-30 02:15:42,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:42,946 INFO L93 Difference]: Finished difference Result 7689 states and 8791 transitions. [2018-01-30 02:15:42,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:42,947 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-01-30 02:15:42,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:42,949 INFO L225 Difference]: With dead ends: 7689 [2018-01-30 02:15:42,950 INFO L226 Difference]: Without dead ends: 5148 [2018-01-30 02:15:42,952 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:15:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5148 states. [2018-01-30 02:15:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5148 to 2647. [2018-01-30 02:15:43,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-01-30 02:15:43,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3019 transitions. [2018-01-30 02:15:43,025 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3019 transitions. Word has length 349 [2018-01-30 02:15:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:43,025 INFO L432 AbstractCegarLoop]: Abstraction has 2647 states and 3019 transitions. [2018-01-30 02:15:43,025 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3019 transitions. [2018-01-30 02:15:43,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-01-30 02:15:43,027 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:43,027 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:43,027 INFO L371 AbstractCegarLoop]: === Iteration 53 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1488659226, now seen corresponding path program 1 times [2018-01-30 02:15:43,027 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:43,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:43,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:43,028 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:43,028 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:43,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:43,200 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:43,200 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:43,200 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:43,200 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:43,200 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:43,200 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:43,200 INFO L87 Difference]: Start difference. First operand 2647 states and 3019 transitions. Second operand 6 states. [2018-01-30 02:15:43,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:43,777 INFO L93 Difference]: Finished difference Result 6811 states and 7785 transitions. [2018-01-30 02:15:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:43,777 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2018-01-30 02:15:43,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:43,780 INFO L225 Difference]: With dead ends: 6811 [2018-01-30 02:15:43,780 INFO L226 Difference]: Without dead ends: 5146 [2018-01-30 02:15:43,782 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:15:43,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5146 states. [2018-01-30 02:15:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5146 to 2647. [2018-01-30 02:15:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-01-30 02:15:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3017 transitions. [2018-01-30 02:15:43,889 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3017 transitions. Word has length 349 [2018-01-30 02:15:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:43,889 INFO L432 AbstractCegarLoop]: Abstraction has 2647 states and 3017 transitions. [2018-01-30 02:15:43,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:43,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3017 transitions. [2018-01-30 02:15:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-01-30 02:15:43,890 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:43,891 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, 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, 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] [2018-01-30 02:15:43,891 INFO L371 AbstractCegarLoop]: === Iteration 54 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:43,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1117885221, now seen corresponding path program 1 times [2018-01-30 02:15:43,891 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:43,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:43,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:43,891 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:43,891 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:43,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:43,899 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:44,068 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:44,068 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:44,068 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:44,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:44,068 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:44,068 INFO L87 Difference]: Start difference. First operand 2647 states and 3017 transitions. Second operand 6 states. [2018-01-30 02:15:44,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:44,914 INFO L93 Difference]: Finished difference Result 7622 states and 8652 transitions. [2018-01-30 02:15:44,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:44,914 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2018-01-30 02:15:44,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:44,917 INFO L225 Difference]: With dead ends: 7622 [2018-01-30 02:15:44,917 INFO L226 Difference]: Without dead ends: 5957 [2018-01-30 02:15:44,919 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:15:44,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5957 states. [2018-01-30 02:15:44,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5957 to 2647. [2018-01-30 02:15:44,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-01-30 02:15:44,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3014 transitions. [2018-01-30 02:15:44,999 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3014 transitions. Word has length 352 [2018-01-30 02:15:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:44,999 INFO L432 AbstractCegarLoop]: Abstraction has 2647 states and 3014 transitions. [2018-01-30 02:15:45,000 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3014 transitions. [2018-01-30 02:15:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-01-30 02:15:45,001 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:45,002 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:45,002 INFO L371 AbstractCegarLoop]: === Iteration 55 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:45,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1153360825, now seen corresponding path program 1 times [2018-01-30 02:15:45,009 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:45,009 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:45,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:45,009 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:45,009 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:45,018 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:45,214 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:45,214 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:45,214 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:45,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:45,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:45,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:45,215 INFO L87 Difference]: Start difference. First operand 2647 states and 3014 transitions. Second operand 6 states. [2018-01-30 02:15:46,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:46,030 INFO L93 Difference]: Finished difference Result 8411 states and 9552 transitions. [2018-01-30 02:15:46,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:46,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2018-01-30 02:15:46,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:46,033 INFO L225 Difference]: With dead ends: 8411 [2018-01-30 02:15:46,033 INFO L226 Difference]: Without dead ends: 5870 [2018-01-30 02:15:46,035 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:15:46,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5870 states. [2018-01-30 02:15:46,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5870 to 2647. [2018-01-30 02:15:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2647 states. [2018-01-30 02:15:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 3011 transitions. [2018-01-30 02:15:46,118 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 3011 transitions. Word has length 352 [2018-01-30 02:15:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:46,118 INFO L432 AbstractCegarLoop]: Abstraction has 2647 states and 3011 transitions. [2018-01-30 02:15:46,118 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:46,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 3011 transitions. [2018-01-30 02:15:46,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-01-30 02:15:46,119 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:46,120 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, 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, 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] [2018-01-30 02:15:46,120 INFO L371 AbstractCegarLoop]: === Iteration 56 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:46,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1417705687, now seen corresponding path program 1 times [2018-01-30 02:15:46,120 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:46,120 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:46,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:46,120 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:46,120 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:46,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:46,128 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 199 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:46,332 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:46,332 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:46,332 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:46,332 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:46,332 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:46,332 INFO L87 Difference]: Start difference. First operand 2647 states and 3011 transitions. Second operand 6 states. [2018-01-30 02:15:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:46,911 INFO L93 Difference]: Finished difference Result 6792 states and 7752 transitions. [2018-01-30 02:15:46,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:46,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2018-01-30 02:15:46,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:46,914 INFO L225 Difference]: With dead ends: 6792 [2018-01-30 02:15:46,914 INFO L226 Difference]: Without dead ends: 5127 [2018-01-30 02:15:46,915 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:15:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5127 states. [2018-01-30 02:15:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5127 to 2611. [2018-01-30 02:15:46,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2018-01-30 02:15:47,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 2973 transitions. [2018-01-30 02:15:47,001 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 2973 transitions. Word has length 352 [2018-01-30 02:15:47,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:47,001 INFO L432 AbstractCegarLoop]: Abstraction has 2611 states and 2973 transitions. [2018-01-30 02:15:47,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:47,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 2973 transitions. [2018-01-30 02:15:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-01-30 02:15:47,003 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:47,003 INFO L350 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:47,003 INFO L371 AbstractCegarLoop]: === Iteration 57 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:47,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1382230083, now seen corresponding path program 1 times [2018-01-30 02:15:47,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:47,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:47,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:47,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:47,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:47,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:47,012 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:47,182 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:47,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:47,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:47,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:47,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:47,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:47,183 INFO L87 Difference]: Start difference. First operand 2611 states and 2973 transitions. Second operand 6 states. [2018-01-30 02:15:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:47,802 INFO L93 Difference]: Finished difference Result 7538 states and 8611 transitions. [2018-01-30 02:15:47,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:47,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 352 [2018-01-30 02:15:47,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:47,805 INFO L225 Difference]: With dead ends: 7538 [2018-01-30 02:15:47,805 INFO L226 Difference]: Without dead ends: 5033 [2018-01-30 02:15:47,808 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:15:47,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2018-01-30 02:15:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 2571. [2018-01-30 02:15:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2018-01-30 02:15:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 2931 transitions. [2018-01-30 02:15:47,893 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 2931 transitions. Word has length 352 [2018-01-30 02:15:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:47,893 INFO L432 AbstractCegarLoop]: Abstraction has 2571 states and 2931 transitions. [2018-01-30 02:15:47,893 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 2931 transitions. [2018-01-30 02:15:47,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-01-30 02:15:47,894 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:47,894 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-01-30 02:15:47,895 INFO L371 AbstractCegarLoop]: === Iteration 58 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:47,895 INFO L82 PathProgramCache]: Analyzing trace with hash -489121205, now seen corresponding path program 1 times [2018-01-30 02:15:47,895 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:47,895 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:47,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:47,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:47,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:47,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:47,902 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:48,045 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:48,045 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:48,045 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:48,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:48,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:48,045 INFO L87 Difference]: Start difference. First operand 2571 states and 2931 transitions. Second operand 4 states. [2018-01-30 02:15:48,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:48,414 INFO L93 Difference]: Finished difference Result 5646 states and 6442 transitions. [2018-01-30 02:15:48,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:48,414 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 359 [2018-01-30 02:15:48,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:48,416 INFO L225 Difference]: With dead ends: 5646 [2018-01-30 02:15:48,416 INFO L226 Difference]: Without dead ends: 3181 [2018-01-30 02:15:48,418 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:15:48,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2018-01-30 02:15:48,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 2607. [2018-01-30 02:15:48,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2607 states. [2018-01-30 02:15:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2607 states to 2607 states and 2976 transitions. [2018-01-30 02:15:48,502 INFO L78 Accepts]: Start accepts. Automaton has 2607 states and 2976 transitions. Word has length 359 [2018-01-30 02:15:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:48,502 INFO L432 AbstractCegarLoop]: Abstraction has 2607 states and 2976 transitions. [2018-01-30 02:15:48,502 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2607 states and 2976 transitions. [2018-01-30 02:15:48,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-01-30 02:15:48,504 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:48,504 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2018-01-30 02:15:48,504 INFO L371 AbstractCegarLoop]: === Iteration 59 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:48,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1461166736, now seen corresponding path program 1 times [2018-01-30 02:15:48,504 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:48,504 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:48,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:48,505 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:48,505 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:48,512 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 221 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-01-30 02:15:48,658 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:48,658 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:48,658 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:48,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:48,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:48,659 INFO L87 Difference]: Start difference. First operand 2607 states and 2976 transitions. Second operand 4 states. [2018-01-30 02:15:48,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:48,952 INFO L93 Difference]: Finished difference Result 5559 states and 6346 transitions. [2018-01-30 02:15:48,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:48,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 362 [2018-01-30 02:15:48,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:48,954 INFO L225 Difference]: With dead ends: 5559 [2018-01-30 02:15:48,954 INFO L226 Difference]: Without dead ends: 3058 [2018-01-30 02:15:48,955 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:15:48,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2018-01-30 02:15:49,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 2616. [2018-01-30 02:15:49,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2616 states. [2018-01-30 02:15:49,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2616 states to 2616 states and 2985 transitions. [2018-01-30 02:15:49,043 INFO L78 Accepts]: Start accepts. Automaton has 2616 states and 2985 transitions. Word has length 362 [2018-01-30 02:15:49,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:49,043 INFO L432 AbstractCegarLoop]: Abstraction has 2616 states and 2985 transitions. [2018-01-30 02:15:49,043 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:49,043 INFO L276 IsEmpty]: Start isEmpty. Operand 2616 states and 2985 transitions. [2018-01-30 02:15:49,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-01-30 02:15:49,045 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:49,045 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, 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, 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:15:49,045 INFO L371 AbstractCegarLoop]: === Iteration 60 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -167109487, now seen corresponding path program 1 times [2018-01-30 02:15:49,045 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:49,045 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:49,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,046 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:49,046 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:49,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:49,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:49,178 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:15:49,178 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:15:49,178 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:15:49,178 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:15:49,178 INFO L87 Difference]: Start difference. First operand 2616 states and 2985 transitions. Second operand 3 states. [2018-01-30 02:15:49,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:49,317 INFO L93 Difference]: Finished difference Result 5192 states and 5936 transitions. [2018-01-30 02:15:49,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:15:49,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 362 [2018-01-30 02:15:49,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:49,319 INFO L225 Difference]: With dead ends: 5192 [2018-01-30 02:15:49,319 INFO L226 Difference]: Without dead ends: 2682 [2018-01-30 02:15:49,321 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:15:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2018-01-30 02:15:49,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2664. [2018-01-30 02:15:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-01-30 02:15:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 3039 transitions. [2018-01-30 02:15:49,405 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 3039 transitions. Word has length 362 [2018-01-30 02:15:49,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:49,405 INFO L432 AbstractCegarLoop]: Abstraction has 2664 states and 3039 transitions. [2018-01-30 02:15:49,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:15:49,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 3039 transitions. [2018-01-30 02:15:49,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-01-30 02:15:49,406 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:49,407 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, 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, 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:15:49,407 INFO L371 AbstractCegarLoop]: === Iteration 61 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:49,407 INFO L82 PathProgramCache]: Analyzing trace with hash 51370169, now seen corresponding path program 1 times [2018-01-30 02:15:49,407 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:49,407 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:49,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:49,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:49,417 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 233 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-01-30 02:15:49,516 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:49,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:15:49,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:15:49,516 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:15:49,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:15:49,517 INFO L87 Difference]: Start difference. First operand 2664 states and 3039 transitions. Second operand 3 states. [2018-01-30 02:15:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:49,715 INFO L93 Difference]: Finished difference Result 5226 states and 5976 transitions. [2018-01-30 02:15:49,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:15:49,715 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 365 [2018-01-30 02:15:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:49,718 INFO L225 Difference]: With dead ends: 5226 [2018-01-30 02:15:49,718 INFO L226 Difference]: Without dead ends: 3543 [2018-01-30 02:15:49,719 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:15:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3543 states. [2018-01-30 02:15:49,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3543 to 3543. [2018-01-30 02:15:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3543 states. [2018-01-30 02:15:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 4045 transitions. [2018-01-30 02:15:49,831 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 4045 transitions. Word has length 365 [2018-01-30 02:15:49,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:49,831 INFO L432 AbstractCegarLoop]: Abstraction has 3543 states and 4045 transitions. [2018-01-30 02:15:49,831 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:15:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 4045 transitions. [2018-01-30 02:15:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-01-30 02:15:49,833 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:49,834 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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:15:49,834 INFO L371 AbstractCegarLoop]: === Iteration 62 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:49,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1337168595, now seen corresponding path program 1 times [2018-01-30 02:15:49,834 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:49,834 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:49,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:49,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:49,844 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:49,927 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:49,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:49,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-30 02:15:49,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 02:15:49,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 02:15:49,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 02:15:49,928 INFO L87 Difference]: Start difference. First operand 3543 states and 4045 transitions. Second operand 3 states. [2018-01-30 02:15:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:50,079 INFO L93 Difference]: Finished difference Result 6984 states and 7988 transitions. [2018-01-30 02:15:50,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 02:15:50,080 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 413 [2018-01-30 02:15:50,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:50,082 INFO L225 Difference]: With dead ends: 6984 [2018-01-30 02:15:50,082 INFO L226 Difference]: Without dead ends: 4422 [2018-01-30 02:15:50,083 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:15:50,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4422 states. [2018-01-30 02:15:50,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4422 to 4422. [2018-01-30 02:15:50,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4422 states. [2018-01-30 02:15:50,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4422 states to 4422 states and 5052 transitions. [2018-01-30 02:15:50,224 INFO L78 Accepts]: Start accepts. Automaton has 4422 states and 5052 transitions. Word has length 413 [2018-01-30 02:15:50,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:50,224 INFO L432 AbstractCegarLoop]: Abstraction has 4422 states and 5052 transitions. [2018-01-30 02:15:50,224 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 02:15:50,224 INFO L276 IsEmpty]: Start isEmpty. Operand 4422 states and 5052 transitions. [2018-01-30 02:15:50,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-01-30 02:15:50,227 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:50,227 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:50,227 INFO L371 AbstractCegarLoop]: === Iteration 63 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:50,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1322608259, now seen corresponding path program 1 times [2018-01-30 02:15:50,227 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:50,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:50,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:50,228 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:50,228 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:50,239 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:50,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:50,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:50,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:50,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:50,727 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:50,728 INFO L87 Difference]: Start difference. First operand 4422 states and 5052 transitions. Second operand 4 states. [2018-01-30 02:15:51,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:51,210 INFO L93 Difference]: Finished difference Result 10494 states and 12006 transitions. [2018-01-30 02:15:51,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:51,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 522 [2018-01-30 02:15:51,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:51,214 INFO L225 Difference]: With dead ends: 10494 [2018-01-30 02:15:51,214 INFO L226 Difference]: Without dead ends: 6178 [2018-01-30 02:15:51,217 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:15:51,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2018-01-30 02:15:51,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4982. [2018-01-30 02:15:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4982 states. [2018-01-30 02:15:51,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4982 states to 4982 states and 5772 transitions. [2018-01-30 02:15:51,370 INFO L78 Accepts]: Start accepts. Automaton has 4982 states and 5772 transitions. Word has length 522 [2018-01-30 02:15:51,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:51,370 INFO L432 AbstractCegarLoop]: Abstraction has 4982 states and 5772 transitions. [2018-01-30 02:15:51,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:51,370 INFO L276 IsEmpty]: Start isEmpty. Operand 4982 states and 5772 transitions. [2018-01-30 02:15:51,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-01-30 02:15:51,373 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:51,373 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:15:51,373 INFO L371 AbstractCegarLoop]: === Iteration 64 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:51,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1345952176, now seen corresponding path program 1 times [2018-01-30 02:15:51,374 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:51,374 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:51,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:51,374 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:51,374 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:51,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:51,386 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:51,696 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:51,696 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:51,696 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:51,697 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:51,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:51,697 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:51,697 INFO L87 Difference]: Start difference. First operand 4982 states and 5772 transitions. Second operand 4 states. [2018-01-30 02:15:52,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:52,179 INFO L93 Difference]: Finished difference Result 10993 states and 12653 transitions. [2018-01-30 02:15:52,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:52,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 525 [2018-01-30 02:15:52,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:52,183 INFO L225 Difference]: With dead ends: 10993 [2018-01-30 02:15:52,184 INFO L226 Difference]: Without dead ends: 6117 [2018-01-30 02:15:52,186 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:15:52,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6117 states. [2018-01-30 02:15:52,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6117 to 4997. [2018-01-30 02:15:52,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4997 states. [2018-01-30 02:15:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4997 states to 4997 states and 5787 transitions. [2018-01-30 02:15:52,341 INFO L78 Accepts]: Start accepts. Automaton has 4997 states and 5787 transitions. Word has length 525 [2018-01-30 02:15:52,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:52,341 INFO L432 AbstractCegarLoop]: Abstraction has 4997 states and 5787 transitions. [2018-01-30 02:15:52,341 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:52,341 INFO L276 IsEmpty]: Start isEmpty. Operand 4997 states and 5787 transitions. [2018-01-30 02:15:52,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 536 [2018-01-30 02:15:52,345 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:52,345 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:52,345 INFO L371 AbstractCegarLoop]: === Iteration 65 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:52,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1043016130, now seen corresponding path program 1 times [2018-01-30 02:15:52,345 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:52,345 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:52,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:52,346 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:52,346 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:52,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:52,880 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 445 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:52,881 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:52,881 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:52,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:52,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:52,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:52,881 INFO L87 Difference]: Start difference. First operand 4997 states and 5787 transitions. Second operand 6 states. [2018-01-30 02:15:53,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:53,943 INFO L93 Difference]: Finished difference Result 17338 states and 19990 transitions. [2018-01-30 02:15:53,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:53,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 535 [2018-01-30 02:15:53,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:53,950 INFO L225 Difference]: With dead ends: 17338 [2018-01-30 02:15:53,950 INFO L226 Difference]: Without dead ends: 12447 [2018-01-30 02:15:53,954 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-01-30 02:15:53,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12447 states. [2018-01-30 02:15:54,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12447 to 5487. [2018-01-30 02:15:54,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5487 states. [2018-01-30 02:15:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5487 states to 5487 states and 6417 transitions. [2018-01-30 02:15:54,133 INFO L78 Accepts]: Start accepts. Automaton has 5487 states and 6417 transitions. Word has length 535 [2018-01-30 02:15:54,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:54,133 INFO L432 AbstractCegarLoop]: Abstraction has 5487 states and 6417 transitions. [2018-01-30 02:15:54,133 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 5487 states and 6417 transitions. [2018-01-30 02:15:54,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-01-30 02:15:54,136 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:54,137 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:15:54,137 INFO L371 AbstractCegarLoop]: === Iteration 66 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:54,137 INFO L82 PathProgramCache]: Analyzing trace with hash -41575919, now seen corresponding path program 1 times [2018-01-30 02:15:54,137 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:54,137 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:54,137 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:54,137 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:54,138 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:54,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:54,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:54,512 INFO L134 CoverageAnalysis]: Checked inductivity of 559 backedges. 451 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-01-30 02:15:54,512 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:54,512 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:15:54,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:15:54,512 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:15:54,512 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:15:54,513 INFO L87 Difference]: Start difference. First operand 5487 states and 6417 transitions. Second operand 6 states. [2018-01-30 02:15:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:55,571 INFO L93 Difference]: Finished difference Result 17767 states and 20547 transitions. [2018-01-30 02:15:55,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:15:55,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 538 [2018-01-30 02:15:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:55,578 INFO L225 Difference]: With dead ends: 17767 [2018-01-30 02:15:55,578 INFO L226 Difference]: Without dead ends: 12386 [2018-01-30 02:15:55,582 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:15:55,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-01-30 02:15:55,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 5067. [2018-01-30 02:15:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5067 states. [2018-01-30 02:15:55,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5067 states to 5067 states and 5862 transitions. [2018-01-30 02:15:55,762 INFO L78 Accepts]: Start accepts. Automaton has 5067 states and 5862 transitions. Word has length 538 [2018-01-30 02:15:55,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:55,762 INFO L432 AbstractCegarLoop]: Abstraction has 5067 states and 5862 transitions. [2018-01-30 02:15:55,762 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:15:55,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5067 states and 5862 transitions. [2018-01-30 02:15:55,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 559 [2018-01-30 02:15:55,765 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:55,765 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:55,765 INFO L371 AbstractCegarLoop]: === Iteration 67 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:55,766 INFO L82 PathProgramCache]: Analyzing trace with hash -258504992, now seen corresponding path program 1 times [2018-01-30 02:15:55,766 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:55,766 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:55,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:55,766 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:55,766 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:55,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:55,777 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 723 backedges. 519 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-30 02:15:56,078 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:56,078 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:56,078 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:56,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:56,078 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:56,078 INFO L87 Difference]: Start difference. First operand 5067 states and 5862 transitions. Second operand 4 states. [2018-01-30 02:15:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:56,571 INFO L93 Difference]: Finished difference Result 11784 states and 13626 transitions. [2018-01-30 02:15:56,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:56,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 558 [2018-01-30 02:15:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:56,575 INFO L225 Difference]: With dead ends: 11784 [2018-01-30 02:15:56,575 INFO L226 Difference]: Without dead ends: 6823 [2018-01-30 02:15:56,578 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6823 states. [2018-01-30 02:15:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6823 to 5627. [2018-01-30 02:15:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5627 states. [2018-01-30 02:15:56,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5627 states to 5627 states and 6582 transitions. [2018-01-30 02:15:56,755 INFO L78 Accepts]: Start accepts. Automaton has 5627 states and 6582 transitions. Word has length 558 [2018-01-30 02:15:56,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:56,756 INFO L432 AbstractCegarLoop]: Abstraction has 5627 states and 6582 transitions. [2018-01-30 02:15:56,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:56,756 INFO L276 IsEmpty]: Start isEmpty. Operand 5627 states and 6582 transitions. [2018-01-30 02:15:56,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-01-30 02:15:56,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:56,759 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, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:56,759 INFO L371 AbstractCegarLoop]: === Iteration 68 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1997916498, now seen corresponding path program 1 times [2018-01-30 02:15:56,759 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:56,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:56,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:56,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:56,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:56,771 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:57,115 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 486 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-01-30 02:15:57,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:57,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:57,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:57,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:57,116 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:57,116 INFO L87 Difference]: Start difference. First operand 5627 states and 6582 transitions. Second operand 4 states. [2018-01-30 02:15:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:57,550 INFO L93 Difference]: Finished difference Result 12445 states and 14539 transitions. [2018-01-30 02:15:57,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:15:57,550 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 561 [2018-01-30 02:15:57,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:57,554 INFO L225 Difference]: With dead ends: 12445 [2018-01-30 02:15:57,554 INFO L226 Difference]: Without dead ends: 6924 [2018-01-30 02:15:57,558 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:15:57,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6924 states. [2018-01-30 02:15:57,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6924 to 6082. [2018-01-30 02:15:57,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2018-01-30 02:15:57,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 7162 transitions. [2018-01-30 02:15:57,738 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 7162 transitions. Word has length 561 [2018-01-30 02:15:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:57,739 INFO L432 AbstractCegarLoop]: Abstraction has 6082 states and 7162 transitions. [2018-01-30 02:15:57,739 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:57,739 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 7162 transitions. [2018-01-30 02:15:57,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2018-01-30 02:15:57,742 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:57,742 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-01-30 02:15:57,743 INFO L371 AbstractCegarLoop]: === Iteration 69 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1307426867, now seen corresponding path program 1 times [2018-01-30 02:15:57,743 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:57,743 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:57,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:57,743 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:57,743 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:57,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:57,754 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:57,960 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 525 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-30 02:15:57,960 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:57,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:57,961 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:57,961 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:57,961 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:57,961 INFO L87 Difference]: Start difference. First operand 6082 states and 7162 transitions. Second operand 4 states. [2018-01-30 02:15:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:58,506 INFO L93 Difference]: Finished difference Result 13193 states and 15433 transitions. [2018-01-30 02:15:58,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:58,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 561 [2018-01-30 02:15:58,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:58,511 INFO L225 Difference]: With dead ends: 13193 [2018-01-30 02:15:58,511 INFO L226 Difference]: Without dead ends: 7217 [2018-01-30 02:15:58,515 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7217 states. [2018-01-30 02:15:58,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7217 to 5607. [2018-01-30 02:15:58,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5607 states. [2018-01-30 02:15:58,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5607 states to 5607 states and 6552 transitions. [2018-01-30 02:15:58,762 INFO L78 Accepts]: Start accepts. Automaton has 5607 states and 6552 transitions. Word has length 561 [2018-01-30 02:15:58,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:58,763 INFO L432 AbstractCegarLoop]: Abstraction has 5607 states and 6552 transitions. [2018-01-30 02:15:58,763 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:58,763 INFO L276 IsEmpty]: Start isEmpty. Operand 5607 states and 6552 transitions. [2018-01-30 02:15:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-01-30 02:15:58,766 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:58,766 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:58,766 INFO L371 AbstractCegarLoop]: === Iteration 70 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:58,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1685220681, now seen corresponding path program 1 times [2018-01-30 02:15:58,767 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:58,767 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:58,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:58,767 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:58,767 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:58,779 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:15:59,185 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-01-30 02:15:59,185 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:15:59,185 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:15:59,186 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:15:59,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:15:59,186 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:59,186 INFO L87 Difference]: Start difference. First operand 5607 states and 6552 transitions. Second operand 4 states. [2018-01-30 02:15:59,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:15:59,672 INFO L93 Difference]: Finished difference Result 12688 states and 14788 transitions. [2018-01-30 02:15:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:15:59,672 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 566 [2018-01-30 02:15:59,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:15:59,677 INFO L225 Difference]: With dead ends: 12688 [2018-01-30 02:15:59,677 INFO L226 Difference]: Without dead ends: 7187 [2018-01-30 02:15:59,680 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:15:59,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7187 states. [2018-01-30 02:15:59,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7187 to 5677. [2018-01-30 02:15:59,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5677 states. [2018-01-30 02:15:59,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5677 states to 5677 states and 6622 transitions. [2018-01-30 02:15:59,868 INFO L78 Accepts]: Start accepts. Automaton has 5677 states and 6622 transitions. Word has length 566 [2018-01-30 02:15:59,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:15:59,868 INFO L432 AbstractCegarLoop]: Abstraction has 5677 states and 6622 transitions. [2018-01-30 02:15:59,868 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:15:59,868 INFO L276 IsEmpty]: Start isEmpty. Operand 5677 states and 6622 transitions. [2018-01-30 02:15:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-01-30 02:15:59,872 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:15:59,872 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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] [2018-01-30 02:15:59,872 INFO L371 AbstractCegarLoop]: === Iteration 71 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:15:59,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2054095894, now seen corresponding path program 1 times [2018-01-30 02:15:59,872 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:15:59,872 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:15:59,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:59,873 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:15:59,873 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:15:59,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:15:59,884 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:00,197 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2018-01-30 02:16:00,197 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:00,197 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:16:00,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:16:00,198 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:16:00,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:00,198 INFO L87 Difference]: Start difference. First operand 5677 states and 6622 transitions. Second operand 4 states. [2018-01-30 02:16:00,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:00,539 INFO L93 Difference]: Finished difference Result 10645 states and 12423 transitions. [2018-01-30 02:16:00,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-30 02:16:00,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 569 [2018-01-30 02:16:00,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:00,543 INFO L225 Difference]: With dead ends: 10645 [2018-01-30 02:16:00,543 INFO L226 Difference]: Without dead ends: 6200 [2018-01-30 02:16:00,546 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:16:00,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6200 states. [2018-01-30 02:16:00,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6200 to 5921. [2018-01-30 02:16:00,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5921 states. [2018-01-30 02:16:00,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5921 states to 5921 states and 6926 transitions. [2018-01-30 02:16:00,733 INFO L78 Accepts]: Start accepts. Automaton has 5921 states and 6926 transitions. Word has length 569 [2018-01-30 02:16:00,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:00,733 INFO L432 AbstractCegarLoop]: Abstraction has 5921 states and 6926 transitions. [2018-01-30 02:16:00,733 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:16:00,733 INFO L276 IsEmpty]: Start isEmpty. Operand 5921 states and 6926 transitions. [2018-01-30 02:16:00,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-01-30 02:16:00,737 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:00,737 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:00,737 INFO L371 AbstractCegarLoop]: === Iteration 72 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:00,737 INFO L82 PathProgramCache]: Analyzing trace with hash 432758270, now seen corresponding path program 1 times [2018-01-30 02:16:00,737 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:00,737 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:00,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:00,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:00,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:00,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:01,234 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 443 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-01-30 02:16:01,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:01,235 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:16:01,235 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:16:01,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:16:01,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:01,235 INFO L87 Difference]: Start difference. First operand 5921 states and 6926 transitions. Second operand 4 states. [2018-01-30 02:16:01,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:01,751 INFO L93 Difference]: Finished difference Result 13241 states and 15456 transitions. [2018-01-30 02:16:01,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:16:01,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 569 [2018-01-30 02:16:01,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:01,755 INFO L225 Difference]: With dead ends: 13241 [2018-01-30 02:16:01,755 INFO L226 Difference]: Without dead ends: 7426 [2018-01-30 02:16:01,759 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:01,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7426 states. [2018-01-30 02:16:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7426 to 5936. [2018-01-30 02:16:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5936 states. [2018-01-30 02:16:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5936 states to 5936 states and 6941 transitions. [2018-01-30 02:16:01,950 INFO L78 Accepts]: Start accepts. Automaton has 5936 states and 6941 transitions. Word has length 569 [2018-01-30 02:16:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:01,950 INFO L432 AbstractCegarLoop]: Abstraction has 5936 states and 6941 transitions. [2018-01-30 02:16:01,950 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:16:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5936 states and 6941 transitions. [2018-01-30 02:16:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-01-30 02:16:01,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:01,955 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, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:01,955 INFO L371 AbstractCegarLoop]: === Iteration 73 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash -831567739, now seen corresponding path program 1 times [2018-01-30 02:16:01,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:01,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:01,955 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:01,956 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:01,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:01,966 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 511 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-30 02:16:02,269 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:02,269 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 02:16:02,269 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:16:02,269 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:16:02,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:16:02,269 INFO L87 Difference]: Start difference. First operand 5936 states and 6941 transitions. Second operand 7 states. [2018-01-30 02:16:03,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:03,624 INFO L93 Difference]: Finished difference Result 20940 states and 24492 transitions. [2018-01-30 02:16:03,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:16:03,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 571 [2018-01-30 02:16:03,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:03,633 INFO L225 Difference]: With dead ends: 20940 [2018-01-30 02:16:03,633 INFO L226 Difference]: Without dead ends: 15110 [2018-01-30 02:16:03,638 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-30 02:16:03,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15110 states. [2018-01-30 02:16:03,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15110 to 6426. [2018-01-30 02:16:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6426 states. [2018-01-30 02:16:03,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6426 states to 6426 states and 7571 transitions. [2018-01-30 02:16:03,858 INFO L78 Accepts]: Start accepts. Automaton has 6426 states and 7571 transitions. Word has length 571 [2018-01-30 02:16:03,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:03,858 INFO L432 AbstractCegarLoop]: Abstraction has 6426 states and 7571 transitions. [2018-01-30 02:16:03,858 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 02:16:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6426 states and 7571 transitions. [2018-01-30 02:16:03,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-01-30 02:16:03,862 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:03,862 INFO L350 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:03,862 INFO L371 AbstractCegarLoop]: === Iteration 74 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:03,862 INFO L82 PathProgramCache]: Analyzing trace with hash 824612913, now seen corresponding path program 1 times [2018-01-30 02:16:03,863 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:03,863 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:03,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:03,863 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:03,863 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:03,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:04,335 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-01-30 02:16:04,335 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:04,336 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:16:04,336 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:16:04,336 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:16:04,336 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:04,336 INFO L87 Difference]: Start difference. First operand 6426 states and 7571 transitions. Second operand 4 states. [2018-01-30 02:16:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:04,913 INFO L93 Difference]: Finished difference Result 14231 states and 16721 transitions. [2018-01-30 02:16:04,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:16:04,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 572 [2018-01-30 02:16:04,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:04,918 INFO L225 Difference]: With dead ends: 14231 [2018-01-30 02:16:04,918 INFO L226 Difference]: Without dead ends: 7911 [2018-01-30 02:16:04,922 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:04,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2018-01-30 02:16:05,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 6441. [2018-01-30 02:16:05,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6441 states. [2018-01-30 02:16:05,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6441 states to 6441 states and 7586 transitions. [2018-01-30 02:16:05,125 INFO L78 Accepts]: Start accepts. Automaton has 6441 states and 7586 transitions. Word has length 572 [2018-01-30 02:16:05,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:05,126 INFO L432 AbstractCegarLoop]: Abstraction has 6441 states and 7586 transitions. [2018-01-30 02:16:05,126 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:16:05,126 INFO L276 IsEmpty]: Start isEmpty. Operand 6441 states and 7586 transitions. [2018-01-30 02:16:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 574 [2018-01-30 02:16:05,130 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:05,130 INFO L350 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,130 INFO L371 AbstractCegarLoop]: === Iteration 75 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:05,130 INFO L82 PathProgramCache]: Analyzing trace with hash -687069600, now seen corresponding path program 1 times [2018-01-30 02:16:05,130 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:05,130 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:05,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:05,131 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:05,131 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:05,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:05,143 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 610 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-01-30 02:16:05,314 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:05,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-30 02:16:05,315 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-30 02:16:05,315 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-30 02:16:05,315 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:05,315 INFO L87 Difference]: Start difference. First operand 6441 states and 7586 transitions. Second operand 4 states. [2018-01-30 02:16:05,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:05,708 INFO L93 Difference]: Finished difference Result 13216 states and 15560 transitions. [2018-01-30 02:16:05,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-30 02:16:05,708 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 573 [2018-01-30 02:16:05,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:05,712 INFO L225 Difference]: With dead ends: 13216 [2018-01-30 02:16:05,712 INFO L226 Difference]: Without dead ends: 6881 [2018-01-30 02:16:05,716 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-30 02:16:05,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6881 states. [2018-01-30 02:16:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6881 to 6656. [2018-01-30 02:16:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2018-01-30 02:16:05,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 7846 transitions. [2018-01-30 02:16:05,923 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 7846 transitions. Word has length 573 [2018-01-30 02:16:05,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:05,924 INFO L432 AbstractCegarLoop]: Abstraction has 6656 states and 7846 transitions. [2018-01-30 02:16:05,924 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-30 02:16:05,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 7846 transitions. [2018-01-30 02:16:05,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-01-30 02:16:05,928 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:05,928 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, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:05,928 INFO L371 AbstractCegarLoop]: === Iteration 76 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:05,928 INFO L82 PathProgramCache]: Analyzing trace with hash 682178423, now seen corresponding path program 1 times [2018-01-30 02:16:05,928 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:05,928 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:05,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:05,929 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:05,929 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:05,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:06,367 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2018-01-30 02:16:06,367 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:06,367 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 02:16:06,367 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-30 02:16:06,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-30 02:16:06,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-30 02:16:06,368 INFO L87 Difference]: Start difference. First operand 6656 states and 7846 transitions. Second operand 6 states. [2018-01-30 02:16:07,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 02:16:07,506 INFO L93 Difference]: Finished difference Result 21048 states and 24666 transitions. [2018-01-30 02:16:07,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 02:16:07,506 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 574 [2018-01-30 02:16:07,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 02:16:07,515 INFO L225 Difference]: With dead ends: 21048 [2018-01-30 02:16:07,515 INFO L226 Difference]: Without dead ends: 14498 [2018-01-30 02:16:07,520 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 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:16:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14498 states. [2018-01-30 02:16:07,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14498 to 6726. [2018-01-30 02:16:07,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6726 states. [2018-01-30 02:16:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6726 states to 6726 states and 7921 transitions. [2018-01-30 02:16:07,755 INFO L78 Accepts]: Start accepts. Automaton has 6726 states and 7921 transitions. Word has length 574 [2018-01-30 02:16:07,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 02:16:07,755 INFO L432 AbstractCegarLoop]: Abstraction has 6726 states and 7921 transitions. [2018-01-30 02:16:07,755 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-30 02:16:07,755 INFO L276 IsEmpty]: Start isEmpty. Operand 6726 states and 7921 transitions. [2018-01-30 02:16:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-01-30 02:16:07,759 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 02:16:07,760 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, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:16:07,760 INFO L371 AbstractCegarLoop]: === Iteration 77 === [ssl3_acceptErr0AssertViolation]=== [2018-01-30 02:16:07,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1690132590, now seen corresponding path program 1 times [2018-01-30 02:16:07,760 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 02:16:07,760 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 02:16:07,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:07,761 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 02:16:07,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 02:16:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 02:16:07,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 02:16:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 721 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2018-01-30 02:16:08,109 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 02:16:08,110 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 02:16:08,110 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 02:16:08,110 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 02:16:08,110 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-30 02:16:08,110 INFO L87 Difference]: Start difference. First operand 6726 states and 7921 transitions. Second operand 7 states. Received shutdown request... [2018-01-30 02:16:08,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-30 02:16:08,819 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-30 02:16:08,823 WARN L185 ceAbstractionStarter]: Timeout [2018-01-30 02:16:08,823 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 02:16:08 BoogieIcfgContainer [2018-01-30 02:16:08,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 02:16:08,824 INFO L168 Benchmark]: Toolchain (without parser) took 67474.08 ms. Allocated memory was 148.9 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 111.7 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 771.6 MB. Max. memory is 5.3 GB. [2018-01-30 02:16:08,824 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 02:16:08,824 INFO L168 Benchmark]: CACSL2BoogieTranslator took 228.97 ms. Allocated memory is still 148.9 MB. Free memory was 111.4 MB in the beginning and 83.8 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. [2018-01-30 02:16:08,824 INFO L168 Benchmark]: Boogie Preprocessor took 40.59 ms. Allocated memory is still 148.9 MB. Free memory was 83.8 MB in the beginning and 80.3 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:16:08,825 INFO L168 Benchmark]: RCFGBuilder took 1403.21 ms. Allocated memory was 148.9 MB in the beginning and 169.9 MB in the end (delta: 21.0 MB). Free memory was 80.3 MB in the beginning and 108.8 MB in the end (delta: -28.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:16:08,825 INFO L168 Benchmark]: TraceAbstraction took 65799.05 ms. Allocated memory was 169.9 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 108.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 747.9 MB. Max. memory is 5.3 GB. [2018-01-30 02:16:08,825 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 148.9 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 228.97 ms. Allocated memory is still 148.9 MB. Free memory was 111.4 MB in the beginning and 83.8 MB in the end (delta: 27.6 MB). Peak memory consumption was 27.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.59 ms. Allocated memory is still 148.9 MB. Free memory was 83.8 MB in the beginning and 80.3 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 5.3 GB. * RCFGBuilder took 1403.21 ms. Allocated memory was 148.9 MB in the beginning and 169.9 MB in the end (delta: 21.0 MB). Free memory was 80.3 MB in the beginning and 108.8 MB in the end (delta: -28.6 MB). Peak memory consumption was 24.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 65799.05 ms. Allocated memory was 169.9 MB in the beginning and 2.0 GB in the end (delta: 1.9 GB). Free memory was 108.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 747.9 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1711]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1711). Cancelled while BasicCegarLoop was constructing difference of abstraction (6726states) and interpolant automaton (currently 7 states, 7 states before enhancement), while ReachableStatesComputation was computing reachable states (3881 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 606 locations, 1 error locations. TIMEOUT Result, 65.7s OverallTime, 77 OverallIterations, 6 TraceHistogramMax, 39.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 75823 SDtfs, 39175 SDslu, 165363 SDs, 0 SdLazy, 41280 SolverSat, 1293 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 754 GetRequests, 250 SyntacticMatches, 145 SemanticMatches, 359 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6726occurred in iteration=76, 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.4s AutomataMinimizationTime, 76 MinimizatonAttempts, 121900 StatesRemovedByMinimization, 72 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 28269 NumberOfCodeBlocks, 28269 NumberOfCodeBlocksAsserted, 77 NumberOfCheckSat, 28192 ConstructedInterpolants, 0 QuantifiedInterpolants, 27772737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 77 InterpolantComputations, 77 PerfectInterpolantSequences, 20015/20015 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_srvr.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-16-08-830.csv Written .csv to /home/daniel/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/s3_srvr.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-16-08-830.csv Completed graceful shutdown